{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:49:25Z","timestamp":1759146565868},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,18]]},"DOI":"10.1145\/1231996.1232023","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:41:00Z","timestamp":1175802060000},"page":"127-134","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Efficient obstacle-avoiding rectilinear steiner tree construction"],"prefix":"10.1145","author":[{"given":"Chung-Wei","family":"Lin","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szu-Yu","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Feng","family":"Li","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao-Wen","family":"Chang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Lin","family":"Yang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/41958.41985"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen , C. Leiserson , R. Rivest , and C. Stein , Introduction to Algorithms , 2 nd edition, The MIT Press , 2001 . T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition, The MIT Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123020"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1994.408768"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800260.809014"},{"key":"e_1_3_2_1_7_1","first-page":"107","article-title":"FORst: a 3-step heuristic for obstacle-avoiding rectilinear Steiner minimal tree construction","author":"Hu Y.","year":"2004","unstructured":"Y. Hu , Z. Feng , T. Jing , X. Hong , Y. Yang , G. Yu , X. Hu , and G. Yan , \" FORst: a 3-step heuristic for obstacle-avoiding rectilinear Steiner minimal tree construction ,\" Journal of Information and Computational Science , pp. 107 -- 116 , 2004 . Y. Hu, Z. Feng, T. Jing, X. Hong, Y. Yang, G. Yu, X. Hu, and G. Yan, \"FORst: a 3-step heuristic for obstacle-avoiding rectilinear Steiner minimal tree construction,\" Journal of Information and Computational Science, pp. 107--116, 2004.","journal-title":"Journal of Information and Computational Science"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120732"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"e_1_3_2_1_10_1","first-page":"1475","volume-title":"IFIPS","author":"Mikami K.","year":"1968","unstructured":"K. Mikami and K. Tabuchi , \" A computer program for optimal routing of printed circuit connectors,\" Proc . IFIPS , pp. 1475 -- 1478 , 1968 , H47. K. Mikami and K. Tabuchi, \"A computer program for optimal routing of printed circuit connectors,\" Proc. IFIPS, pp. 1475--1478, 1968, H47."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.45"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1118299.1118447"},{"key":"e_1_3_2_1_13_1","first-page":"348","volume-title":"ASIC","author":"Yang Y.","year":"2003","unstructured":"Y. Yang , Q. Zhu , T. Jing , X. Hong , and Y. Wang , \" Rectilinear Steiner minimal tree among obstacles,\" Proc . ASIC , pp. 348 -- 351 , 2003 . Y. Yang, Q. Zhu, T. Jing, X. Hong, and Y. Wang, \"Rectilinear Steiner minimal tree among obstacles,\" Proc. ASIC, pp. 348--351, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.826557"}],"event":{"name":"ISPD07: International Symposium on Physical Design","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"Austin Texas USA","acronym":"ISPD07"},"container-title":["Proceedings of the 2007 international symposium on Physical design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1231996.1232023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T04:57:04Z","timestamp":1673240224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1231996.1232023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,18]]},"references-count":14,"alternative-id":["10.1145\/1231996.1232023","10.1145\/1231996"],"URL":"https:\/\/doi.org\/10.1145\/1231996.1232023","relation":{},"subject":[],"published":{"date-parts":[[2007,3,18]]},"assertion":[{"value":"2007-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}