{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:21:31Z","timestamp":1767842491411,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,26]],"date-time":"2009-07-26T00:00:00Z","timestamp":1248566400000},"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,7,26]]},"DOI":"10.1145\/1629911.1630026","type":"proceedings-article","created":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T15:11:11Z","timestamp":1255446671000},"page":"424-429","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion"],"prefix":"10.1145","author":[{"given":"Shiyan","family":"Hu","sequence":"first","affiliation":[{"name":"Michigan Technological University, Houghton, Michigan"}]},{"given":"Zhuo","family":"Li","sequence":"additional","affiliation":[{"name":"IBM Austin Research Laboratory, Austin, Texas"}]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[{"name":"IBM Austin Research Laboratory, Austin, Texas"}]}],"member":"320","published-online":{"date-parts":[[2009,7,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825841"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.920581"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353648"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981107"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1990.112223"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847942"},{"key":"e_1_3_2_1_8_1","volume-title":"A flexible data structure for efficient buffer insertion,\" ICCD","author":"Chen R.","year":"2004","unstructured":"R. Chen and H. Zhou , \" A flexible data structure for efficient buffer insertion,\" ICCD , 2004 . R. Chen and H. Zhou, \"A flexible data structure for efficient buffer insertion,\" ICCD, 2004."},{"key":"e_1_3_2_1_9_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 and Z. Li and C. Alpert , \" Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost ,\" ASPDAC , pp. 609 -- 614 , 2004 . W. Shi and Z. Li and C. Alpert, \"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost,\" ASPDAC, pp. 609--614, 2004.","journal-title":"ASPDAC"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277145"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1146990"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278567"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309885"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391651"},{"key":"e_1_3_2_1_15_1","volume-title":"Buffer block planning for interconnect-driven floorplanning,\" ICCAD","author":"Cong J.","year":"1999","unstructured":"J. Cong , T. Kong , and D. Z. Pan , \" Buffer block planning for interconnect-driven floorplanning,\" ICCAD , 1999 . J. Cong, T. Kong, and D. Z. Pan, \"Buffer block planning for interconnect-driven floorplanning,\" ICCAD, 1999."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378461"},{"key":"e_1_3_2_1_17_1","volume-title":"A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" ICCAD","author":"Hu S.","year":"2008","unstructured":"S. Hu , Z. Li , and C. J. Alpert , \" A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" ICCAD , 2008 . S. Hu, Z. Li, and C. J. Alpert, \"A polynomial time approximation scheme for timing constrained minimum cost layer assignment,\" ICCAD, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514932.1514969"}],"event":{"name":"DAC '09: The 46th Annual Design Automation Conference 2009","location":"San Francisco California","acronym":"DAC '09","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CAS Circuits & Systems"]},"container-title":["Proceedings of the 46th Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629911.1630026","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1629911.1630026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:16Z","timestamp":1750249396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629911.1630026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,26]]},"references-count":18,"alternative-id":["10.1145\/1629911.1630026","10.1145\/1629911"],"URL":"https:\/\/doi.org\/10.1145\/1629911.1630026","relation":{},"subject":[],"published":{"date-parts":[[2009,7,26]]},"assertion":[{"value":"2009-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}