{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:09:11Z","timestamp":1760404151624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,3,25]],"date-time":"2018-03-25T00:00:00Z","timestamp":1521936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1525749"],"award-info":[{"award-number":["1525749"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,3,25]]},"DOI":"10.1145\/3177540.3178237","type":"proceedings-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T12:53:36Z","timestamp":1521204816000},"page":"132-138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Interconnect Optimization Considering Multiple Critical Paths"],"prefix":"10.1145","author":[{"given":"Jiang","family":"Hu","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhou","sequence":"additional","affiliation":[{"name":"IBM Corporation, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaoguang","family":"Wei","sequence":"additional","affiliation":[{"name":"IBM Corporation, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Quay","sequence":"additional","affiliation":[{"name":"IBM Corporation, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmi","family":"Reddy","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Tellez","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gi-Joon","family":"Nam","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Buffered Steiner trees for difficult instances","volume":"21","author":"Alpert C. J.","year":"2002","unstructured":"C. J. Alpert , G. Gandham , M. Hrkic , J. Hu , A. B. Kahng , J. Lillis , B. Liu , S. T. Quay , S. S. Sapatnekar , and A. J. Sullivan . 2002 . Buffered Steiner trees for difficult instances . IEEE Transactions on Computer-Aided Design Vol. 21 , 1 (Jan. 2002), 3--14. C. J. Alpert, G. Gandham, M. Hrkic, J. Hu, A. B. Kahng, J. Lillis, B. Liu, S. T. Quay, S. S. Sapatnekar, and A. J. Sullivan. 2002. Buffered Steiner trees for difficult instances. IEEE Transactions on Computer-Aided Design Vol. 21, 1 (Jan. 2002), 3--14.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855889"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.391737"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123032"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.476573"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"C. P. Chen H. Zhou and D. F. Wong. 1996. Optimal non-uniform wire-sizing under the Elmore delay model Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 38--43. C. P. Chen H. Zhou and D. F. Wong. 1996. Optimal non-uniform wire-sizing under the Elmore delay model Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 38--43.","DOI":"10.1145\/240518.240611"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.365123"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.752927"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/513918.514066"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.809648"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/240518.240594"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J. Lillis C. K. Cheng and T. Y. Lin. 1996 b. Simultaneous routing and buffer insertion for high performance interconnect Proceedings of the Great Lake Symposium on VLSI. 148--153. J. Lillis C. K. Cheng and T. Y. Lin. 1996 b. Simultaneous routing and buffer insertion for high performance interconnect Proceedings of the Great Lake Symposium on VLSI. 148--153.","DOI":"10.1109\/GLSV.1996.497611"},{"volume-title":"ACM Physical Design Workshop. 1--6.","author":"Okamoto T.","key":"e_1_3_2_1_14_1","unstructured":"T. Okamoto and J. Cong . 1996. Interconnect layout optimization by simultaneous Steiner tree construction and buffer insertion . In ACM Physical Design Workshop. 1--6. T. Okamoto and J. Cong. 1996. Interconnect layout optimization by simultaneous Steiner tree construction and buffer insertion. In ACM Physical Design Workshop. 1--6."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981107"},{"volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 724--731","author":"Ozdal M.","key":"e_1_3_2_1_16_1","unstructured":"M. Ozdal , S. Burns , and J. Hu . 2011. Gate sizing and device technology selection algorithms for high-performance industrial designs . In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 724--731 . M. Ozdal, S. Burns, and J. Hu. 2011. Gate sizing and device technology selection algorithms for high-performance industrial designs. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 724--731."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065794"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847942"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"L. P. P. P. van Ginneken. 1990. Buffer placement in distributed RC-tree networks for minimal Elmore delay Proceedings of the IEEE International Symposium on Circuits and Systems. 865--868. L. P. P. P. van Ginneken. 1990. Buffer placement in distributed RC-tree networks for minimal Elmore delay Proceedings of the IEEE International Symposium on Circuits and Systems. 865--868.","DOI":"10.1109\/ISCAS.1990.112223"}],"event":{"name":"ISPD '18: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"ISPD '18"},"container-title":["Proceedings of the 2018 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3178237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177540.3178237","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177540.3178237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T20:59:04Z","timestamp":1751489944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3178237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,25]]},"references-count":19,"alternative-id":["10.1145\/3177540.3178237","10.1145\/3177540"],"URL":"https:\/\/doi.org\/10.1145\/3177540.3178237","relation":{},"subject":[],"published":{"date-parts":[[2018,3,25]]},"assertion":[{"value":"2018-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}