{"id":"https://openalex.org/W2013557211","doi":"https://doi.org/10.1145/2228360.2228441","title":"Algorithms and data structures for fast and good VLSI routing","display_name":"Algorithms and data structures for fast and good VLSI routing","publication_year":2012,"publication_date":"2012-05-31","ids":{"openalex":"https://openalex.org/W2013557211","doi":"https://doi.org/10.1145/2228360.2228441","mag":"2013557211"},"language":"en","primary_location":{"id":"doi:10.1145/2228360.2228441","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2228360.2228441","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual 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/A5014230726","display_name":"Michael Gester","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Gester","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042146726","display_name":"Dirk M\u00fcller","orcid":"https://orcid.org/0000-0002-6106-6607"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dirk M\u00fcller","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038202013","display_name":"Tim Nieberg","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim Nieberg","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046214572","display_name":"Christian Panten","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Panten","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021717408","display_name":"Christian Schulte","orcid":"https://orcid.org/0000-0002-6283-7004"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schulte","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["University of Bonn, Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5014230726"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":1.964,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.8695715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"459","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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":1.0,"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.9991000294685364,"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.8558835983276367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7077091932296753},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6729085445404053},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.6468143463134766},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.6363643407821655},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5803954601287842},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.49220457673072815},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.48931047320365906},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.47268515825271606},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4645305573940277},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4557790458202362},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.43989139795303345},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4264149069786072},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4228590726852417},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41608908772468567},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.4145433008670807},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41447755694389343},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4110286831855774},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2544594407081604},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.251478374004364},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20035669207572937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15245062112808228},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.11330053210258484}],"concepts":[{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.8558835983276367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7077091932296753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6729085445404053},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.6468143463134766},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.6363643407821655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5803954601287842},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.49220457673072815},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.48931047320365906},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.47268515825271606},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4645305573940277},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4557790458202362},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43989139795303345},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4264149069786072},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4228590726852417},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41608908772468567},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.4145433008670807},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41447755694389343},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4110286831855774},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2544594407081604},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.251478374004364},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20035669207572937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15245062112808228},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.11330053210258484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/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.1145/2228360.2228441","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2228360.2228441","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1527354963","https://openalex.org/W1605203071","https://openalex.org/W1969483458","https://openalex.org/W1975577567","https://openalex.org/W1989599214","https://openalex.org/W2038987112","https://openalex.org/W2077969951","https://openalex.org/W2082473446","https://openalex.org/W2109102305","https://openalex.org/W2125831674","https://openalex.org/W2151822553","https://openalex.org/W2163105316","https://openalex.org/W2405635102","https://openalex.org/W3197732161","https://openalex.org/W6713576531"],"related_works":["https://openalex.org/W2139746613","https://openalex.org/W1512070990","https://openalex.org/W2147199059","https://openalex.org/W1545101503","https://openalex.org/W2001312276","https://openalex.org/W2397529362","https://openalex.org/W2532223616","https://openalex.org/W2085445946","https://openalex.org/W4254557149","https://openalex.org/W2183106894"],"abstract_inverted_index":{"We":[0,61],"present":[1],"advanced":[2],"data":[3,42,51],"structures":[4],"and":[5,9,12,47,77,94],"algorithms":[6,57],"for":[7,27,44,53],"fast":[8],"high-quality":[10],"global":[11],"detailed":[13],"routing":[14,19,32],"in":[15],"modern":[16],"technologies.":[17],"Global":[18],"is":[20,82],"based":[21,38],"on":[22,39],"a":[23,40,48,69],"combinatorial":[24],"approximation":[25],"scheme":[26],"min-max":[28],"resource":[29],"sharing.":[30],"Detailed":[31],"uses":[33],"exact":[34],"shortest":[35],"path":[36],"algorithms,":[37],"shape-based":[41],"structure":[43,52],"pin":[45],"access":[46],"two-level":[49],"track-based":[50],"long-distance":[54],"connections.":[55],"All":[56],"are":[58],"very":[59],"fast.":[60],"demonstrate":[62],"their":[63],"superiority":[64],"over":[65,83],"traditional":[66],"approaches":[67],"by":[68,97],"comparison":[70],"to":[71],"an":[72],"industrial":[73],"router":[74,81],"(on":[75],"32nm":[76],"22nm":[78],"chips).":[79],"Our":[80],"two":[84],"times":[85],"faster,":[86],"has":[87],"5%":[88],"less":[89,92],"netlength,":[90],"20%":[91],"vias,":[93],"reduces":[95],"detours":[96],"more":[98],"than":[99],"90%.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}