{"id":"https://openalex.org/W2155807996","doi":"https://doi.org/10.1145/1629911.1629998","title":"An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction","display_name":"An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction","publication_year":2009,"publication_date":"2009-07-26","ids":{"openalex":"https://openalex.org/W2155807996","doi":"https://doi.org/10.1145/1629911.1629998","mag":"2155807996"},"language":"en","primary_location":{"id":"doi:10.1145/1629911.1629998","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1629911.1629998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 46th Annual Design Automation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008771140","display_name":"Chih-Hung Liu","orcid":"https://orcid.org/0000-0001-9683-5982"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chih-Hung Liu","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087250153","display_name":"Shih\u2010Yi Yuan","orcid":"https://orcid.org/0000-0002-3704-0917"},"institutions":[{"id":"https://openalex.org/I4880106","display_name":"Feng Chia University","ror":"https://ror.org/05vhczg54","country_code":"TW","type":"education","lineage":["https://openalex.org/I4880106"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shih-Yi Yuan","raw_affiliation_strings":["Feng Chia University"],"affiliations":[{"raw_affiliation_string":"Feng Chia University","institution_ids":["https://openalex.org/I4880106"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043885374","display_name":"Sy\u2010Yen Kuo","orcid":"https://orcid.org/0000-0002-3021-8321"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Sy-Yen Kuo","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067978605","display_name":"Yao\u2013Hsin Chou","orcid":"https://orcid.org/0000-0002-3254-5510"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yao-Hsin Chou","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008771140"],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":2.6917,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.90573296,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"314","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9252174496650696},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7468087673187256},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6931107640266418},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6083659529685974},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5953659415245056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5714571475982666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5346533060073853},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45950859785079956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4162904620170593},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41582798957824707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3668251931667328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3482409119606018}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9252174496650696},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7468087673187256},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6931107640266418},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6083659529685974},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5953659415245056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5714571475982666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5346533060073853},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45950859785079956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4162904620170593},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41582798957824707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3668251931667328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3482409119606018},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1629911.1629998","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1629911.1629998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 46th Annual Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6202010576","display_name":null,"funder_award_id":"NSC 97-2221-E-002-216-MY3","funder_id":"https://openalex.org/F4320321040","funder_display_name":"National Science Council"}],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1538422958","https://openalex.org/W1977187766","https://openalex.org/W2006625555","https://openalex.org/W2011024254","https://openalex.org/W2020112047","https://openalex.org/W2063372577","https://openalex.org/W2077558841","https://openalex.org/W2117449332","https://openalex.org/W2137890965","https://openalex.org/W2162320001","https://openalex.org/W2170811771","https://openalex.org/W4242246215","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2054452185","https://openalex.org/W2362006006","https://openalex.org/W2021808862","https://openalex.org/W2105127960","https://openalex.org/W2021517364","https://openalex.org/W1934761836","https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080"],"abstract_inverted_index":{"For":[0],"the":[1,54,81,91,96,100,110],"obstacle-avoiding":[2],"rectilinear":[3],"Steiner":[4],"minimal":[5],"tree":[6],"problem,":[7],"this":[8],"paper":[9],"presents":[10],"an":[11],"O(n":[12],"log":[13],"n)-time":[14],"algorithm":[15,89],"with":[16,80],"theoretical":[17],"optimality":[18],"guarantees":[19],"on":[20],"a":[21,35,75],"number":[22],"of":[23,56,99,109],"specific":[24],"cases,":[25],"which":[26],"required":[27],"O(n3)":[28],"time":[29],"in":[30],"previous":[31],"works.":[32],"We":[33],"propose":[34],"new":[36,76],"framework":[37,61],"to":[38,78],"directly":[39],"generate":[40],"O(n)":[41],"critical":[42],"paths":[43,52],"as":[44],"essential":[45],"solution":[46],"components,":[47],"and":[48,72],"prove":[49],"that":[50,87,108],"those":[51],"guarantee":[53],"existence":[55],"desirable":[57],"solutions.":[58,113],"The":[59],"path-based":[60],"neither":[62],"generates":[63],"invalid":[64],"initial":[65],"solutions":[66,102],"nor":[67],"constructs":[68],"connected":[69],"routing":[70],"graphs,":[71],"thus":[73],"provides":[74],"way":[77],"deal":[79],"OARSMT":[82],"problem.":[83],"Experimental":[84],"results":[85],"show":[86],"our":[88],"achieves":[90],"best":[92,111],"speed":[93],"performance,":[94],"while":[95],"average":[97],"wirelength":[98],"resulting":[101],"is":[103],"only":[104],"1.1%":[105],"longer":[106],"than":[107],"existing":[112]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}