{"id":"https://openalex.org/W2078144752","doi":"https://doi.org/10.1145/1119772.1119955","title":"Highly scalable algorithms for rectilinear and octilinear Steiner trees","display_name":"Highly scalable algorithms for rectilinear and octilinear Steiner trees","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2078144752","doi":"https://doi.org/10.1145/1119772.1119955","mag":"2078144752"},"language":"en","primary_location":{"id":"doi:10.1145/1119772.1119955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","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/A5073558386","display_name":"Andrew B. Kahng","orcid":"https://orcid.org/0000-0002-4490-5018"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew B. Kahng","raw_affiliation_strings":["University of California at San Diego, La Jolla, California","Department of Computer Science and Engineering, University of California San Diego, CA, USA;"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, La Jolla, California","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California San Diego, CA, USA;","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014788373","display_name":"Ion M\u0103ndoiu","orcid":"https://orcid.org/0000-0002-4818-0237"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ion I. M\u0103ndoiu","raw_affiliation_strings":["University of California at San Diego, La Jolla, California","Department of Computer Science and Engineering, University of California San Diego, CA, USA;"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, La Jolla, California","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California San Diego, CA, USA;","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Z. Zelikovsky","raw_affiliation_strings":["Georgia State University, University Plaza, Atlanta, Georgia"],"affiliations":[{"raw_affiliation_string":"Georgia State University, University Plaza, Atlanta, Georgia","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073558386"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":8.4992,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.98049606,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"827","last_page":"827"},"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.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8651654720306396},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7223537564277649},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6378984451293945},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6252855062484741},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6160348057746887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5710687637329102},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5667059421539307},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48781636357307434},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.474814772605896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40087443590164185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29158270359039307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10091671347618103}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8651654720306396},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7223537564277649},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6378984451293945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6252855062484741},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6160348057746887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5710687637329102},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5667059421539307},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48781636357307434},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.474814772605896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40087443590164185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29158270359039307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10091671347618103},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1119772.1119955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.6583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.6583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/compendium94-03/papers/2003/aspdac03/pdffiles/09b_1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.498.3138","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.3138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vlsicad.ucsd.edu/Publications/Conferences/142/c142.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1506404251","https://openalex.org/W1548939632","https://openalex.org/W2012130001","https://openalex.org/W2016523183","https://openalex.org/W2018443281","https://openalex.org/W2020112047","https://openalex.org/W2026175709","https://openalex.org/W2028766782","https://openalex.org/W2064086982","https://openalex.org/W2080879057","https://openalex.org/W2086709935","https://openalex.org/W2132627508","https://openalex.org/W2140055763","https://openalex.org/W2158731879","https://openalex.org/W2160207217","https://openalex.org/W2161510970","https://openalex.org/W2610955095"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W3119129187","https://openalex.org/W803550684","https://openalex.org/W2007032764","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W4352977312"],"abstract_inverted_index":{"The":[0],"rectilinear":[1,21,75,128,219],"Steiner":[2,76],"minimum":[3,129],"tree":[4,131],"(RSMT)":[5],"problem,":[6],"which":[7],"asks":[8],"for":[9,46,72],"a":[10,14,65,80,149,154,210],"minimum-length":[11],"interconnection":[12],"of":[13,17,25,56,58,83,89,109,135,173],"given":[15],"set":[16],"terminals":[18,122],"in":[19,29,39,157,214],"the":[20,26,44,84,107,127,169],"plane,":[22],"is":[23,182],"one":[24],"fundamental":[27],"problems":[28],"electronic":[30],"design":[31,156],"automation.":[32],"Recently":[33],"there":[34],"has":[35,140],"been":[36],"renewed":[37],"interest":[38],"this":[40,61],"problem":[41],"due":[42],"to":[43,51,163,189,220],"need":[45],"highly":[47],"scalable":[48],"algorithms":[49],"able":[50],"handle":[52,190],"nets":[53],"with":[54,118],"tens":[55],"thousands":[57],"terminals.":[59],"In":[60],"paper":[62],"we":[63],"give":[64],"practical":[66,191],"O":[67],"(n":[68],"log2":[69],"n)":[70],"heuristic":[71,103,124,139,172,181],"computing":[73],"near-optimal":[74],"trees":[77],"based":[78],"on":[79,94,115],"batched":[81],"version":[82],"greedy":[85],"triple":[86],"contraction":[87],"algorithm":[88],"Zelikovsky":[90],"[21].":[91],"Experiments":[92],"conducted":[93],"both":[95],"random":[96,116],"and":[97,176,201],"industry":[98],"testcases":[99],"show":[100,208],"that":[101],"our":[102,123,138,180],"matches":[104],"or":[105],"exceeds":[106],"quality":[108],"best":[110],"known":[111],"RSMT":[112],"heuristics,":[113],"e.g.,":[114,145],"instances":[117],"more":[119],"than":[120,159],"100":[121],"improves":[125],"over":[126,164],"spanning":[130],"by":[132,168],"an":[133],"average":[134],"11%.":[136],"Moreover,":[137],"very":[141],"well":[142],"scaling":[143],"runtime,":[144],"it":[146,184],"can":[147,185],"route":[148],"34k-terminals":[150],"net":[151],"extracted":[152],"from":[153,218],"real":[155],"less":[158],"25":[160],"seconds":[161],"compared":[162],"86":[165],"minutes":[166],"needed":[167],"O(n2)":[170],"edge-based":[171],"Borah,":[174],"Owens,":[175],"Irwin":[177],"[3].":[178],"Since":[179],"graph-based,":[183],"be":[186],"easily":[187],"modified":[188],"considerations":[192],"such":[193],"as":[194],"routing":[195,203],"obstacles,":[196],"preferred":[197],"directions,":[198],"via":[199],"costs,":[200],"octilinear":[202,221],"-":[204],"indeed,":[205],"experimental":[206],"results":[207],"only":[209],"small":[211],"factor":[212],"increase":[213],"runtime":[215],"when":[216],"switching":[217],"routing.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}