{"id":"https://openalex.org/W1995489428","doi":"https://doi.org/10.1109/asicon.2013.6811916","title":"Graph Steiner tree construction and its routing applications","display_name":"Graph Steiner tree construction and its routing applications","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W1995489428","doi":"https://doi.org/10.1109/asicon.2013.6811916","mag":"1995489428"},"language":"en","primary_location":{"id":"doi:10.1109/asicon.2013.6811916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asicon.2013.6811916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 10th International Conference on ASIC","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/A5084918710","display_name":"Jun Dong","orcid":"https://orcid.org/0000-0002-0026-6680"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I4210132426","display_name":"Shanghai Fudan Microelectronics (China)","ror":"https://ror.org/02vfj3j86","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210132426"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Dong","raw_affiliation_strings":["Department of Microelectronics, Fudan University, Shanghai, China","Department of Microelectronics, Fudan University, Shanghai 200433, China,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai 200433, China,","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020841047","display_name":"Hengliang Zhu","orcid":"https://orcid.org/0000-0002-0338-9256"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I4210132426","display_name":"Shanghai Fudan Microelectronics (China)","ror":"https://ror.org/02vfj3j86","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210132426"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengliang Zhu","raw_affiliation_strings":["Department of Microelectronics, Fudan University, Shanghai, China","Department of Microelectronics, Fudan University, Shanghai 200433, China,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai 200433, China,","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101611201","display_name":"Min Xie","orcid":"https://orcid.org/0000-0002-4385-0465"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I4210132426","display_name":"Shanghai Fudan Microelectronics (China)","ror":"https://ror.org/02vfj3j86","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210132426"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Min Xie","raw_affiliation_strings":["Department of Microelectronics, Fudan University, Shanghai, China","Department of Microelectronics, Fudan University, Shanghai 200433, China,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai 200433, China,","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064213921","display_name":"Xuan Zeng","orcid":"https://orcid.org/0000-0002-8097-4053"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I4210132426","display_name":"Shanghai Fudan Microelectronics (China)","ror":"https://ror.org/02vfj3j86","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210132426"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuan Zeng","raw_affiliation_strings":["Department of Microelectronics, Fudan University, Shanghai, China","Department of Microelectronics, Fudan University, Shanghai 200433, China,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Microelectronics, Fudan University, Shanghai 200433, China,","institution_ids":["https://openalex.org/I4210132426","https://openalex.org/I24943067"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4801,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68308562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":null,"first_page":"1","last_page":"4"},"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.9998000264167786,"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.9998000264167786,"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.9945999979972839,"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.9944999814033508,"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.9552822113037109},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.686660647392273},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6217331290245056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6001636385917664},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5378828048706055},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4911060333251953},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48991888761520386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.474031001329422},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.46979841589927673},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4582573175430298},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.45683807134628296},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.44922131299972534},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3961696922779083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.367058664560318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3517093360424042},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2511105537414551},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24928498268127441},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.23521506786346436},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09893110394477844}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9552822113037109},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.686660647392273},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6217331290245056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6001636385917664},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5378828048706055},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4911060333251953},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48991888761520386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.474031001329422},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.46979841589927673},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4582573175430298},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.45683807134628296},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.44922131299972534},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3961696922779083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.367058664560318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3517093360424042},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2511105537414551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24928498268127441},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.23521506786346436},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09893110394477844},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/asicon.2013.6811916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asicon.2013.6811916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 10th International Conference on ASIC","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2042492403","https://openalex.org/W2080879057","https://openalex.org/W2117937654","https://openalex.org/W2118320476","https://openalex.org/W2180570939","https://openalex.org/W2401610261","https://openalex.org/W4232940466"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W974563791","https://openalex.org/W2772001064","https://openalex.org/W4232603692","https://openalex.org/W1595291551","https://openalex.org/W1585318792","https://openalex.org/W2096702260","https://openalex.org/W1992573093","https://openalex.org/W2999680961","https://openalex.org/W3213899165"],"abstract_inverted_index":{"A":[0],"new":[1,31],"heuristic":[2,32,83,94],"algorithm":[3,33,84],"is":[4,64],"presented":[5],"for":[6,47,58,85],"graph":[7],"Steiner":[8,42,53],"tree":[9,23,44,55],"problem":[10,45,56],"(GSTP)":[11],"with":[12,112],"high":[13],"quality":[14],"solution.":[15],"It":[16],"consists":[17],"of":[18,116],"four":[19],"steps":[20],"based":[21],"on":[22],"splitting":[24],"and":[25,50,96],"merging.":[26],"Then":[27],"we":[28],"apply":[29],"this":[30],"to":[34,66,74,99],"IC":[35],"chip":[36],"routing":[37],"applications":[38],"including":[39],"obstacle-avoiding":[40,51],"rectilinear":[41],"minimal":[43,54],"(OARSMT)":[46],"Manhattan":[48],"architecture":[49],"octilinear":[52],"(OAOSMT)":[57],"X-architecture.":[59],"Through":[60],"escape":[61],"graph,":[62],"OARSMT":[63],"converted":[65],"GSTP.":[67],"We":[68],"also":[69],"propose":[70],"several":[71],"geometric":[72],"transformations":[73],"construct":[75,100],"OAOSMT":[76,101],"from":[77],"OARSMT.":[78,117],"Experimental":[79],"results":[80],"show":[81],"our":[82,97],"GSTP":[86],"can":[87,102],"get":[88],"better":[89],"solutions":[90],"than":[91],"traditional":[92],"classic":[93],"algorithms":[95],"method":[98],"reduce":[103],"total":[104],"wire":[105,114],"length":[106,115],"by":[107],"at":[108],"most":[109],"15%,":[110],"compared":[111],"the":[113]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}