{"id":"https://openalex.org/W2914161519","doi":"https://doi.org/10.1109/tcad.2019.2894653","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":2019,"publication_date":"2019-01-24","ids":{"openalex":"https://openalex.org/W2914161519","doi":"https://doi.org/10.1109/tcad.2019.2894653","mag":"2914161519"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2019.2894653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2019.2894653","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-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/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":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gengjie Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chinese University of Hong Kong, 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":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Evangeline F. Y. Young","raw_affiliation_strings":["Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052177721"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":1.4463,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.81957954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"39","issue":"6","first_page":"1217","last_page":"1230"},"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.9995999932289124,"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.9995999932289124,"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.9939000010490417,"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.9921000003814697,"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.940729022026062},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7960889339447021},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.6733773350715637},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6381832361221313},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5893971920013428},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5750061869621277},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5335899591445923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5050180554389954},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5003328323364258},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.496811181306839},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.492844820022583},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4595334529876709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4529135227203369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4419460594654083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4375031292438507},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4167090058326721},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.39933162927627563},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3815622627735138},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.25107288360595703},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.08999046683311462},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08067482709884644}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.940729022026062},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7960889339447021},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.6733773350715637},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6381832361221313},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5893971920013428},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5750061869621277},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5335899591445923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5050180554389954},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5003328323364258},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.496811181306839},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.492844820022583},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4595334529876709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4529135227203369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4419460594654083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4375031292438507},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4167090058326721},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.39933162927627563},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3815622627735138},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25107288360595703},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.08999046683311462},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08067482709884644},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcad.2019.2894653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2019.2894653","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G6391098150","display_name":null,"funder_award_id":"CUHK14208914","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1508240458","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/W1997570556","https://openalex.org/W2016523183","https://openalex.org/W2020112047","https://openalex.org/W2034999260","https://openalex.org/W2054695963","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2076265641","https://openalex.org/W2078144752","https://openalex.org/W2082635360","https://openalex.org/W2087275089","https://openalex.org/W2096664649","https://openalex.org/W2100322482","https://openalex.org/W2104723386","https://openalex.org/W2107375256","https://openalex.org/W2118269922","https://openalex.org/W2125831674","https://openalex.org/W2133484570","https://openalex.org/W2137962804","https://openalex.org/W2140055763","https://openalex.org/W2144677702","https://openalex.org/W2150488380","https://openalex.org/W2232049732","https://openalex.org/W2294107416","https://openalex.org/W2343109328","https://openalex.org/W2534264947","https://openalex.org/W2609612113","https://openalex.org/W2772001064","https://openalex.org/W2790641181","https://openalex.org/W2790830285","https://openalex.org/W2809138360","https://openalex.org/W2951475756","https://openalex.org/W4232603692","https://openalex.org/W4242440486","https://openalex.org/W4246219036","https://openalex.org/W4256503466","https://openalex.org/W6649927315","https://openalex.org/W6669716958","https://openalex.org/W6752264190"],"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/W1585318792","https://openalex.org/W1524393328","https://openalex.org/W2949165555","https://openalex.org/W2096702260","https://openalex.org/W4244816249"],"abstract_inverted_index":{"In":[0,42],"a":[1,5,16,47,78],"weighted":[2],"undirected":[3],"graph,":[4],"spanning/Steiner":[6],"shallow-light":[7],"tree":[8,26,85,152],"(SLT)":[9],"simultaneously":[10],"approximates:":[11],"1)":[12],"shortest":[13],"distances":[14],"from":[15,101],"root":[17],"to":[18,34,74,103,121,146],"the":[19,24,39,62,67,98,124],"other":[20],"vertices":[21],"and":[22,60,86,115,139,149],"2)":[23],"minimum":[25,84,89],"weight.":[27],"The":[28,94,126],"Steiner":[29,49,54,83,88],"SLT":[30,50,55,70],"has":[31,61],"been":[32],"proved":[33],"be":[35],"exponentially":[36],"lighter":[37],"than":[38],"spanning":[40],"one.":[41],"this":[43],"paper,":[44],"we":[45],"propose":[46],"novel":[48],"construction":[51,153],"method":[52],"called":[53],"(SALT),":[56],"which":[57],"is":[58],"efficient":[59],"tightest":[63],"bound":[64],"over":[65],"all":[66],"state-of-the-art":[68],"general-graph":[69],"algorithms.":[71],"Applying":[72],"SALT":[73,131],"Manhattan":[75],"space":[76],"offers":[77],"smooth":[79],"tradeoff":[80],"between":[81],"rectilinear":[82,87],"arborescence":[90],"for":[91],"VLSI":[92],"routing.":[93],"adaption":[95],"also":[96,142],"reduces":[97],"time":[99],"complexity":[100],"O(n2)":[102],"O(n":[104],"log":[105],"n).":[106],"Besides,":[107],"several":[108],"effective":[109],"post-processing":[110],"methods,":[111],"including":[112],"safe":[113],"refinement":[114],"shallowness-constrained":[116],"edge":[117],"substitution,":[118],"are":[119],"proposed":[120],"further":[122],"improve":[123],"result.":[125],"experimental":[127],"results":[128],"show":[129],"that":[130],"can":[132],"achieve":[133],"not":[134],"only":[135],"short":[136],"path":[137],"lengths":[138],"wirelength":[140],"but":[141],"small":[143],"delay,":[144],"compared":[145],"both":[147],"classical":[148],"recent":[150],"routing":[151],"methods.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}