{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T03:18:50Z","timestamp":1784949530391,"version":"3.55.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/tcad.2013.2238291","type":"journal-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T18:07:02Z","timestamp":1368641222000},"page":"882-893","source":"Crossref","is-referenced-by-count":23,"title":["ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles"],"prefix":"10.1109","volume":"32","author":[{"given":"Tao","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evangeline F. Y.","family":"Young","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","first-page":"48","article-title":"An <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$O(n\\log n)$<\/tex><\/formula> algorithm for obstacle-avoiding routing tree construction in the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\lambda$<\/tex><\/formula> -geometry plane","author":"feng","year":"2006","journal-title":"Proc Int Symp Phys Des"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.126"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1994.408768"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687405"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2098930"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4757-3171-2_6","author":"warme","year":"2000","journal-title":"Advances in Steiner Trees"},{"key":"ref16","author":"polzin","year":"2003","journal-title":"Algorithms for the Steiner Problem in Networks"},{"key":"ref17","first-page":"173","author":"duin","year":"2000","journal-title":"Advances in Steiner Trees"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676904"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792229672"},{"key":"ref28","author":"warme","year":"1998","journal-title":"Spanning trees in hypergraphs with applications to Steiner trees"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.45"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612335"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006098"},{"key":"ref29","year":"2003","journal-title":"GeoSteinerSoftware for Computing Steiner Trees"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917583"},{"key":"ref8","first-page":"314","article-title":"An <formula formulatype=\"inline\"><tex Notation=\"TeX\">$O(n\\log n)$<\/tex><\/formula> path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction","author":"liu","year":"2009","journal-title":"Proc Des Automat Conf"},{"key":"ref7","first-page":"523","article-title":"Obstacle-avoiding rectilinear Steiner tree construction","author":"li","year":"2008","journal-title":"Proc Int Conf Comput -Aided Des"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024762"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2096571"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654220"},{"key":"ref20","author":"hwang","year":"1992","journal-title":"The Steiner Tree Problem"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/net.1026"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0130013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147011"},{"key":"ref23","first-page":"107","article-title":"FORst: A 3-step heuristic for obstacle-avoiding rectilinear Steiner minimal tree construction","volume":"1","author":"hu","year":"2004","journal-title":"J Inform Comput Sci"},{"key":"ref26","first-page":"308","article-title":"Optimal rectilinear Steiner minimal trees in <formula formulatype=\"inline\"><tex Notation=\"TeX\">$O(n^{2}2.62^{n})$<\/tex><\/formula> time","author":"ganley","year":"1994","journal-title":"Proc Canadian Conf Computational Geometry"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<125::AID-NET4>3.3.CO;2-J"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6516595\/06516642.pdf?arnumber=6516642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:25Z","timestamp":1638218425000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6516642\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2013.2238291","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}