{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:40:13Z","timestamp":1763642413522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:00:00Z","timestamp":1529712000000},"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":[[2018,6,23]]},"DOI":"10.1145\/3225209.3225215","type":"proceedings-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T15:14:53Z","timestamp":1530285293000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A study of optimal cost-skew tradeoff and remaining suboptimality in interconnect tree constructions"],"prefix":"10.1145","author":[{"given":"Kwangsoo","family":"Han","sequence":"first","affiliation":[{"name":"UC San Diego"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Christopher","family":"Moyes","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Alex","family":"Zelikovsky","sequence":"additional","affiliation":[{"name":"Georgia State University"}]}],"member":"320","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3177540.3178239"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/43.391737"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1146909.1147012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1002\/net.3230100207"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/ASIC.1992.270316"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/43.331412"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/82.204128"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1137\/S0895480199352622"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/3199700.3199776"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/TCAD.2007.907068"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/293625.293628"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/43.137519"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/645460.654092"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/157485.165065"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/090776147"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1137\/13094791X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/2744769.2744839"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. ISPD, 2018","author":"Hill A.","year":"2018","unstructured":"A. Hill , keynote address , Proc. ISPD, 2018 . http:\/\/www.ispd.cc\/slides\/ 2018 \/k1.pdf (Slide 17). A. Hill, keynote address, Proc. ISPD, 2018. http:\/\/www.ispd.cc\/slides\/2018\/k1.pdf (Slide 17)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/43.46785"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/217474.217579"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/2691365.2691446"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/978-1-4757-2363-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/43.486268"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1023\/A:1007995125716"},{"key":"e_1_3_2_1_25_1","first-page":"103","volume-title":"Proc. SODA","author":"Kortsarz G.","year":"1997","unstructured":"G. Kortsarz and D. Peleg , \" Approximating Shallow-light Trees \", Proc. SODA , 1997 , pp. 103 -- 110 . G. Kortsarz and D. Peleg, \"Approximating Shallow-light Trees\", Proc. SODA, 1997, pp. 103--110."},{"key":"e_1_3_2_1_26_1","first-page":"243","volume-title":"Proc. SODA","author":"Khuller S.","year":"1993","unstructured":"S. Khuller , B. Raghavachari and N. Young , \" Balancing Minimum Spanning Trees and Shortest-path Trees \", Proc. SODA , 1993 , pp. 243 -- 250 . S. Khuller, B. Raghavachari and N. Young, \"Balancing Minimum Spanning Trees and Shortest-path Trees\", Proc. SODA, 1993, pp. 243--250."},{"key":"e_1_3_2_1_27_1","first-page":"1568","volume-title":"Proc. ISCAS","author":"Leung K.-S.","year":"1997","unstructured":"K.-S. Leung and J. Cong , \" Fast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem \", Proc. ISCAS , 1997 , pp. 1568 -- 1571 . K.-S. Leung and J. Cong, \"Fast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem\", Proc. ISCAS, 1997, pp. 1568--1571."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/157485.164656"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/240518.240595"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1016\/S0166-218X(03)00445-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1109\/TCAD.2005.855928"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/BF01758762"},{"unstructured":"L. Scheffer Bookshelf RMST code http:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/RSMT\/RMST.  L. Scheffer Bookshelf RMST code http:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/RSMT\/RMST.","key":"e_1_3_2_1_33_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1007\/s00453-016-0149-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1137\/S0097539704371353"},{"unstructured":"B. Taskin personal communication Oct. 2012.  B. Taskin personal communication Oct. 2012.","key":"e_1_3_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/567270.567271"},{"key":"e_1_3_2_1_38_1","first-page":"81","volume-title":"D.Z. Du, J.M. Smith and J.H. Rubinstein (Eds.) Advances in Steiner Trees","author":"Warme D. M.","year":"2000","unstructured":"D. M. Warme , P. Winter and M. Zachariasen , \" Exact Algorithms for Plane Steiner Tree Problems: A Computational Study \", in D.Z. Du, J.M. Smith and J.H. Rubinstein (Eds.) Advances in Steiner Trees , Kluwer Academic Publishers , 2000 , pp. 81 -- 116 . D. M. Warme, P. Winter and M. Zachariasen, \"Exact Algorithms for Plane Steiner Tree Problems: A Computational Study\", in D.Z. Du, J.M. Smith and J.H. Rubinstein (Eds.) Advances in Steiner Trees, Kluwer Academic Publishers, 2000, pp. 81--116."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1137\/S0895480100378367"},{"key":"e_1_3_2_1_40_1","first-page":"591","article-title":"Apparatus and Method for Determining Buffered Steiner Trees for Complex Circuits","volume":"6","author":"Alpert C. J.","year":"2003","unstructured":"C. J. Alpert , R. G. Gandham , J. Hu , S. T. Quay and A. J. Sullivan , \" Apparatus and Method for Determining Buffered Steiner Trees for Complex Circuits \", U.S. Patent 6 , 591 ,411, July 2003 . C. J. Alpert, R. G. Gandham, J. Hu, S. T. Quay and A. J. Sullivan, \"Apparatus and Method for Determining Buffered Steiner Trees for Complex Circuits\", U.S. Patent 6,591,411, July 2003.","journal-title":"U.S. Patent"},{"key":"e_1_3_2_1_41_1","first-page":"921","article-title":"Node Spreading Via Artificial Density Enhancement to Reduce Routing Congestion","volume":"7","author":"Furnish G. M.","year":"2011","unstructured":"G. M. Furnish , M. J. LeBrun and S. Bose , \" Node Spreading Via Artificial Density Enhancement to Reduce Routing Congestion \", U.S. Patent 7 , 921 ,392, Apr. 2011 . G. M. Furnish, M. J. LeBrun and S. Bose, \"Node Spreading Via Artificial Density Enhancement to Reduce Routing Congestion\", U.S. Patent 7,921,392, Apr. 2011.","journal-title":"U.S. Patent"},{"key":"e_1_3_2_1_42_1","first-page":"853","article-title":"Interconnect-driven Physical Synthesis using Persistent Virtual Routing","volume":"7","author":"Saxena P.","year":"2010","unstructured":"P. Saxena , V. Khandelwal , C. Qiao , P-H. Ho , J. C. Lin and M. A. Iyer , \" Interconnect-driven Physical Synthesis using Persistent Virtual Routing \", U.S. Patent 7 , 853 ,915, December 2010 . P. Saxena, V. Khandelwal, C. Qiao, P-H. Ho, J. C. Lin and M. A. Iyer, \"Interconnect-driven Physical Synthesis using Persistent Virtual Routing\", U.S. Patent 7,853,915, December 2010.","journal-title":"U.S. Patent"},{"unstructured":"http:\/\/www.geosteiner.com\/  http:\/\/www.geosteiner.com\/","key":"e_1_3_2_1_43_1"},{"unstructured":"L. He C.-K. Koh D. Z. Pan and X. Yuan TRIO release B 1.0 http:\/\/vlsicad.eecs.umich.edu\/BK\/Slots\/cache\/cadlab.cs.ucla.edu\/software_release\/trio\/htdocs  L. He C.-K. Koh D. Z. Pan and X. Yuan TRIO release B 1.0 http:\/\/vlsicad.eecs.umich.edu\/BK\/Slots\/cache\/cadlab.cs.ucla.edu\/software_release\/trio\/htdocs","key":"e_1_3_2_1_44_1"},{"key":"e_1_3_2_1_45_1","volume-title":"MARCO GSRC Bookshelf","author":"Tsao C.-W. A.","year":"2002","unstructured":"C.-W. A. Tsao , BST-DME source code , MARCO GSRC Bookshelf , 2002 . https:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/BST\/download\/ C.-W. A. Tsao, BST-DME source code, MARCO GSRC Bookshelf, 2002. https:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/BST\/download\/"},{"unstructured":"ITRS 2013 Edition Report - Interconnect. https:\/\/www.semiconductors.org\/clientuploads\/Research_Technology\/ITRS\/2013\/2013Interconnect.pdf  ITRS 2013 Edition Report - Interconnect. https:\/\/www.semiconductors.org\/clientuploads\/Research_Technology\/ITRS\/2013\/2013Interconnect.pdf","key":"e_1_3_2_1_46_1"},{"unstructured":"IBM ILOG CPLEX. www.ilog.com\/products\/cplex\/  IBM ILOG CPLEX. www.ilog.com\/products\/cplex\/","key":"e_1_3_2_1_47_1"}],"event":{"sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CS"],"acronym":"SLIP '18","name":"SLIP '18: System Level Interconnect Prediction Workshop","location":"San Francisco California"},"container-title":["Proceedings of the 20th System Level Interconnect Prediction Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225209.3225215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225209.3225215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:51Z","timestamp":1750210791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225209.3225215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,23]]},"references-count":47,"alternative-id":["10.1145\/3225209.3225215","10.1145\/3225209"],"URL":"https:\/\/doi.org\/10.1145\/3225209.3225215","relation":{},"subject":[],"published":{"date-parts":[[2018,6,23]]},"assertion":[{"value":"2018-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}