{"id":"https://openalex.org/W4247156909","doi":"https://doi.org/10.1109/aspdac.2009.4796542","title":"FastRoute 4.0: Global router with efficient via minimization","display_name":"FastRoute 4.0: Global router with efficient via minimization","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W4247156909","doi":"https://doi.org/10.1109/aspdac.2009.4796542"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2009.4796542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2009.4796542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Asia and South Pacific 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/A5101853550","display_name":"Yue Xu","orcid":"https://orcid.org/0000-0003-2518-7273"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yue Xu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103123689","display_name":"Yanheng Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yanheng Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101613339","display_name":"Chris Chu","orcid":"https://orcid.org/0000-0001-6073-1719"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Chu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State university, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":6.1038,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.96687065,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"576","last_page":"581"},"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.9997000098228455,"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.9944999814033508,"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/router","display_name":"Router","score":0.8104422688484192},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7398042678833008},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6883225440979004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6787889003753662},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6663663983345032},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.644597053527832},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4831520915031433},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4642634391784668},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42318424582481384},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3763285279273987},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3316691517829895},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2869616150856018},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16092076897621155}],"concepts":[{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.8104422688484192},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7398042678833008},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6883225440979004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6787889003753662},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6663663983345032},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.644597053527832},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4831520915031433},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4642634391784668},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42318424582481384},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3763285279273987},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3316691517829895},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2869616150856018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16092076897621155},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2009.4796542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2009.4796542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Asia and South Pacific Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1603813963","https://openalex.org/W2085073472","https://openalex.org/W2110827694","https://openalex.org/W2133435384","https://openalex.org/W2135477945","https://openalex.org/W2165545669","https://openalex.org/W3142387955","https://openalex.org/W3143454667","https://openalex.org/W3145225676","https://openalex.org/W4243621528","https://openalex.org/W4247567994","https://openalex.org/W4249660316","https://openalex.org/W6678300669","https://openalex.org/W6679151251","https://openalex.org/W6679928151","https://openalex.org/W6681296858"],"related_works":["https://openalex.org/W2021808862","https://openalex.org/W2127180614","https://openalex.org/W2117492357","https://openalex.org/W4245571887","https://openalex.org/W2040311870","https://openalex.org/W2177095534","https://openalex.org/W2362006006","https://openalex.org/W2132489107","https://openalex.org/W2167711148","https://openalex.org/W2047561482"],"abstract_inverted_index":{"The":[0],"number":[1,52],"of":[2,17],"vias":[3,33],"generated":[4],"during":[5],"the":[6,15,26,35,50,56,63],"global":[7,22,46,58],"routing":[8,37,59,70],"stage":[9],"is":[10],"a":[11,30,45],"critical":[12],"factor":[13],"for":[14,32],"yield":[16],"final":[18],"circuits.":[19],"However,":[20],"most":[21],"routers":[23],"only":[24],"approach":[25],"problem":[27,54],"by":[28],"charging":[29],"cost":[31,38],"in":[34,93],"maze":[36],"function.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43],"present":[44],"router":[47],"that":[48],"addresses":[49],"via":[51,64,79,95],"optimization":[53],"throughout":[55],"entire":[57],"flow.":[60],"We":[61,81],"introduce":[62],"aware":[65],"Steiner":[66],"tree":[67],"generation,":[68],"3-bend":[69],"and":[71,89,97],"layer":[72],"assignment":[73],"with":[74],"careful":[75],"ordering":[76],"to":[77],"reduce":[78],"count.":[80],"integrate":[82],"these":[83],"three":[84],"techniques":[85],"into":[86],"FastRoute":[87],"3.0":[88],"achieve":[90],"significant":[91],"reduction":[92],"both":[94],"count":[96],"runtime.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}