{"id":"https://openalex.org/W4378233792","doi":"https://doi.org/10.1007/s10107-023-01962-4","title":"Faster goal-oriented shortest path search for bulk and incremental detailed routing","display_name":"Faster goal-oriented shortest path search for bulk and incremental detailed routing","publication_year":2023,"publication_date":"2023-05-24","ids":{"openalex":"https://openalex.org/W4378233792","doi":"https://doi.org/10.1007/s10107-023-01962-4"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-023-01962-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01962-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01962-4.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01962-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029457523","display_name":"Markus Ahrens","orcid":"https://orcid.org/0000-0002-0588-9043"},"institutions":[{"id":"https://openalex.org/I4210095996","display_name":"IBM (Germany)","ror":"https://ror.org/00pm7rm97","country_code":"DE","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210095996"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Ahrens","raw_affiliation_strings":["IBM Deutschland Research & Development GmbH, B\u00f6blingen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Deutschland Research & Development GmbH, B\u00f6blingen, Germany","institution_ids":["https://openalex.org/I4210095996"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030771611","display_name":"Dorothee Henke","orcid":"https://orcid.org/0000-0001-9190-642X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothee Henke","raw_affiliation_strings":["Department of Mathematics, TU Dortmund University, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9190-642X","affiliations":[{"raw_affiliation_string":"Department of Mathematics, TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068666931","display_name":"Stefan Rabenstein","orcid":"https://orcid.org/0000-0002-9204-3010"},"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":"Stefan Rabenstein","raw_affiliation_strings":["Research Institute for Discrete Mathematics, Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9204-3010","affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany","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":["Research Institute for Discrete Mathematics, Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029457523"],"corresponding_institution_ids":["https://openalex.org/I4210095996"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.6642,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74283003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"206","issue":"1-2","first_page":"3","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6601263880729675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6593466997146606},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5254843831062317},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.49166375398635864},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4739946126937866},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4353031814098358},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.43510088324546814},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42162948846817017},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2620639204978943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2580772042274475},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10030615329742432}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6601263880729675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6593466997146606},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5254843831062317},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.49166375398635864},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4739946126937866},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4353031814098358},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.43510088324546814},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42162948846817017},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2620639204978943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2580772042274475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10030615329742432},{"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/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.1007/s10107-023-01962-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01962-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01962-4.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10107-023-01962-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01962-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01962-4.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G139981621","display_name":null,"funder_award_id":"EXC\u00a059 and EXC-2047 (Hausdorff Center for Mathematics)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G174421807","display_name":null,"funder_award_id":"EXC 59","funder_id":"https://openalex.org/F4320328568","funder_display_name":"Hausdorff Center for Mathematics"},{"id":"https://openalex.org/G2690402149","display_name":null,"funder_award_id":"BU 2313/6","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320328568","display_name":"Hausdorff Center for Mathematics","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378233792.pdf"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1605203071","https://openalex.org/W1969483458","https://openalex.org/W1977985432","https://openalex.org/W1984627834","https://openalex.org/W1987647724","https://openalex.org/W1990141217","https://openalex.org/W2011297770","https://openalex.org/W2082473446","https://openalex.org/W2098038484","https://openalex.org/W2126876121","https://openalex.org/W2129736362","https://openalex.org/W2132026455","https://openalex.org/W2151822553","https://openalex.org/W2159467132","https://openalex.org/W2169528473","https://openalex.org/W2609612113","https://openalex.org/W4231104284","https://openalex.org/W4239775161"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":{"Abstract":[0],"We":[1,43,114],"develop":[2],"new":[3,120],"algorithmic":[4],"techniques":[5],"for":[6],"VLSI":[7],"detailed":[8,79],"routing.":[9],"First,":[10],"we":[11,71],"improve":[12],"the":[13,33,36,47,50,73,76,96,111],"goal-oriented":[14],"version":[15],"of":[16,46,75,98],"Dijkstra\u2019s":[17],"algorithm":[18],"to":[19,49,66,117],"find":[20],"shortest":[21,82],"paths":[22],"in":[23],"huge":[24],"incomplete":[25],"grid":[26],"graphs":[27],"with":[28,88],"edge":[29],"costs":[30],"depending":[31],"on":[32,40],"direction":[34],"and":[35,38,59,85],"layer,":[37],"possibly":[39],"rectangular":[41],"regions.":[42],"devise":[44],"estimates":[45],"distance":[48],"targets":[51],"that":[52,103],"offer":[53],"better":[54],"trade-offs":[55],"between":[56],"running":[57],"time":[58],"quality":[60],"than":[61],"previously":[62],"known":[63],"methods,":[64],"leading":[65],"an":[67],"overall":[68],"speed-up.":[69],"Second,":[70],"combine":[72],"advantages":[74],"two":[77],"classical":[78],"routing":[80],"approaches\u2014global":[81],"path":[83],"search":[84],"track":[86,99],"assignment":[87],"local":[89],"corrections\u2014by":[90],"treating":[91],"input":[92],"wires":[93],"(such":[94],"as":[95,101],"output":[97],"assignment)":[100],"reservations":[102],"can":[104],"be":[105],"used":[106],"at":[107],"a":[108],"discount":[109],"by":[110],"respective":[112],"net.":[113],"show":[115],"how":[116],"implement":[118],"this":[119],"approach":[121],"efficiently.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2023-05-26T00:00:00"}