{"id":"https://openalex.org/W4232603692","doi":"https://doi.org/10.1109/iccad.2017.8203828","title":"SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm","display_name":"SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W4232603692","doi":"https://doi.org/10.1109/iccad.2017.8203828"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2017.8203828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2017.8203828","pdf_url":null,"source":{"id":"https://openalex.org/S4363608376","display_name":"2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5052177721","display_name":"Gengjie Chen","orcid":"https://orcid.org/0000-0001-6016-4742"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Gengjie Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, NT, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090740843","display_name":"Peishan Tu","orcid":"https://orcid.org/0000-0002-1727-8119"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Peishan Tu","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, NT, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070795253","display_name":"Evangeline F. Y. Young","orcid":"https://orcid.org/0000-0003-0623-1590"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Evangeline F. Y. Young","raw_affiliation_strings":["Chinese University of Hong Kong, New Territories, HK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, New Territories, HK","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"512","issue":null,"first_page":"569","last_page":"576"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.996399998664856,"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.9562299847602844},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7421677708625793},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.7074853777885437},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6841344237327576},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6292304992675781},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.591820240020752},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5509049296379089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5460410714149475},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5006179809570312},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.4672513008117676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4563513398170471},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45434802770614624},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43257689476013184},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4205361604690552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4104191064834595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.409784197807312},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36990436911582947},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3260704278945923},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23231393098831177},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.08546316623687744}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9562299847602844},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7421677708625793},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.7074853777885437},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6841344237327576},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6292304992675781},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.591820240020752},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5509049296379089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5460410714149475},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5006179809570312},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.4672513008117676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4563513398170471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45434802770614624},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43257689476013184},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4205361604690552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4104191064834595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.409784197807312},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36990436911582947},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3260704278945923},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23231393098831177},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.08546316623687744},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2017.8203828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2017.8203828","pdf_url":null,"source":{"id":"https://openalex.org/S4363608376","display_name":"2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1764866826","https://openalex.org/W1966241942","https://openalex.org/W1972057929","https://openalex.org/W1976477084","https://openalex.org/W1981463101","https://openalex.org/W1988808425","https://openalex.org/W1991381307","https://openalex.org/W2016523183","https://openalex.org/W2020112047","https://openalex.org/W2034999260","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2082635360","https://openalex.org/W2087275089","https://openalex.org/W2104723386","https://openalex.org/W2118095775","https://openalex.org/W2125831674","https://openalex.org/W2140055763","https://openalex.org/W2150488380","https://openalex.org/W2343109328","https://openalex.org/W2752573522","https://openalex.org/W2951475756","https://openalex.org/W4242440486"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W1595291551","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W2999680961","https://openalex.org/W1524393328","https://openalex.org/W1585318792","https://openalex.org/W2949165555","https://openalex.org/W2096702260","https://openalex.org/W4244816249"],"abstract_inverted_index":{"In":[0,44,98],"a":[1,5,16,49,80],"weighted":[2],"undirected":[3],"graph,":[4],"spanning/Steiner":[6],"shallow-light":[7],"tree":[8,26,87,143],"(SLT)":[9],"simultaneously":[10],"approximates":[11],"(i)":[12],"shortest":[13],"distances":[14],"from":[15,107],"root":[17],"to":[18,34,76,113,137],"the":[19,24,39,65,70,100,104],"other":[20],"vertices,":[21],"and":[22,63,89,130,140],"(ii)":[23],"minimum":[25,86,92],"weight.":[27],"The":[28,117],"Steiner":[29,51,85,91],"SLT":[30,52,72],"has":[31,64],"been":[32],"proved":[33],"be":[35],"exponentially":[36],"lighter":[37],"than":[38],"spanning":[40],"one":[41],"[1],":[42],"[2].":[43],"this":[45],"paper,":[46],"we":[47],"propose":[48],"novel":[50],"construction":[53,144],"method":[54],"called":[55],"SALT":[56,75,122],"(Steiner":[57],"shAllow-Light":[58],"Tree),":[59],"which":[60],"is":[61],"efficient":[62],"tightest":[66],"bound":[67],"over":[68],"all":[69],"state-of-the-art":[71],"algorithms.":[73],"Applying":[74],"Manhattan":[77],"space":[78],"offers":[79],"smooth":[81],"trade-off":[82],"between":[83],"rectilinear":[84,90],"(RSMT)":[88],"arborescence":[93],"(RSMA)":[94],"for":[95],"VLSI":[96],"routing.":[97],"addition,":[99],"adaption":[101],"further":[102],"reduces":[103],"time":[105],"complexity":[106],"O(n":[108,114],"<sup":[109],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[111],")":[112],"log":[115],"n).":[116],"experimental":[118],"results":[119],"show":[120],"that":[121],"can":[123],"achieve":[124],"not":[125],"only":[126],"short":[127],"path":[128],"lengths":[129],"wirelength":[131],"but":[132],"also":[133],"small":[134],"delay,":[135],"compared":[136],"both":[138],"classical":[139],"recent":[141],"routing":[142],"methods.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}