{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:27Z","timestamp":1750307187563,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,25]],"date-time":"2012-03-25T00:00:00Z","timestamp":1332633600000},"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":[[2012,3,25]]},"DOI":"10.1145\/2160916.2160940","type":"proceedings-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T15:17:28Z","timestamp":1332861448000},"page":"105-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph"],"prefix":"10.1145","author":[{"given":"Chung-Kuan","family":"Cheng","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Du","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Hung","family":"Weng","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Gurobi optimizer 4.0. http:\/\/www.gurobi.com\/.  Gurobi optimizer 4.0. http:\/\/www.gurobi.com\/."},{"key":"e_1_3_2_1_2_1","first-page":"38","volume-title":"IEEE International Workshop on Rapid System Prototyping","author":"Bazargan K.","year":"2002","unstructured":"K. Bazargan , R. Kastner and M. Sarrafzadeh . 3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems . IEEE International Workshop on Rapid System Prototyping , pp. 38 -- 43 , 2002 . K. Bazargan, R. Kastner and M. Sarrafzadeh. 3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems. IEEE International Workshop on Rapid System Prototyping, pp. 38--43, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.09.004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032648.1033378"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748197"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120899"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542429"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.673630"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.476573"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/343647.343869"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133429.2133511"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758762"},{"key":"e_1_3_2_1_14_1","first-page":"780","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Shi W.","year":"2000","unstructured":"W. Shi and C. Su . The rectilinear Steiner arborescence problem is NP-complete . Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 780 -- 787 , 2000 . W. Shi and C. Su. The rectilinear Steiner arborescence problem is NP-complete. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 780--787, 2000."},{"key":"e_1_3_2_1_15_1","volume-title":"Approximation algorithms","author":"Vazirani V. V.","year":"2010","unstructured":"V. V. Vazirani . Approximation algorithms . Springer , 2010 . V. V. Vazirani. Approximation algorithms. Springer, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629958"}],"event":{"name":"ISPD'12: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Napa California USA","acronym":"ISPD'12"},"container-title":["Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2160916.2160940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2160916.2160940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:05:48Z","timestamp":1750241148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2160916.2160940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,25]]},"references-count":16,"alternative-id":["10.1145\/2160916.2160940","10.1145\/2160916"],"URL":"https:\/\/doi.org\/10.1145\/2160916.2160940","relation":{},"subject":[],"published":{"date-parts":[[2012,3,25]]},"assertion":[{"value":"2012-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}