{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:38:12Z","timestamp":1770917892584,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,29]],"date-time":"2009-03-29T00:00:00Z","timestamp":1238284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,29]]},"DOI":"10.1145\/1514932.1514969","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"167-174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A faster approximation scheme for timing driven minimum cost layer assignment"],"prefix":"10.1145","author":[{"given":"Shiyan","family":"Hu","sequence":"first","affiliation":[{"name":"Michigan Technological University, Houghton, MI, USA"}]},{"given":"Zhuo","family":"Li","sequence":"additional","affiliation":[{"name":"IBM Austin Research Lab, Austin, TX, USA"}]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[{"name":"IBM Austin Research Lab, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,3,29]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" in ICCAD","author":"Hu S.","year":"2008","unstructured":"S. Hu , Z. Li , and C. Alpert , \" A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" in ICCAD , 2008 . S. Hu, Z. Li, and C. Alpert, \"A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" in ICCAD, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353648"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/81.481198"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.771182"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165065"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.365123"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.905678"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1990.112223"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.906477"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.854631"},{"key":"e_1_3_2_1_14_1","first-page":"609","article-title":"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost","author":"Shi W.","year":"2004","unstructured":"W. Shi , Z. Li and C. J. Alpert , \" Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost ,\" in ASPDAC , pp. 609 -- 614 , 2004 . W. Shi, Z. Li and C. J. Alpert, \"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost,\" in ASPDAC, pp. 609--614, 2004.","journal-title":"ASPDAC"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00205-3"}],"event":{"name":"ISPD09: International Symposium on Physical Design","location":"San Diego California USA","acronym":"ISPD09","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2009 international symposium on Physical design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514932.1514969","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1514932.1514969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:44Z","timestamp":1750253924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514932.1514969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,29]]},"references-count":15,"alternative-id":["10.1145\/1514932.1514969","10.1145\/1514932"],"URL":"https:\/\/doi.org\/10.1145\/1514932.1514969","relation":{},"subject":[],"published":{"date-parts":[[2009,3,29]]},"assertion":[{"value":"2009-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}