{"id":"https://openalex.org/W2129154450","doi":"https://doi.org/10.1090/dimacs/074/04","title":"High-performance multi-level routing","display_name":"High-performance multi-level routing","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2129154450","doi":"https://doi.org/10.1090/dimacs/074/04","mag":"2129154450"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074/04","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/04","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},"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/A5060646771","display_name":"Daniel Delling","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel Delling","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032901794","display_name":"Martin H\u00f6lzer","orcid":"https://orcid.org/0000-0001-7090-8717"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Holzer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056500617","display_name":"Kirill M\u00fcller","orcid":"https://orcid.org/0000-0002-1416-3412"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kirill M\u00fcller","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091644374","display_name":"Frank Schulz","orcid":"https://orcid.org/0000-0002-3144-8479"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank Schulz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5060646771"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1181,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88381938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9976999759674072,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9957000017166138,"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/computer-science","display_name":"Computer science","score":0.6496447920799255},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6435443758964539},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5671866536140442},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.477543443441391},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4406864643096924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40363481640815735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33179113268852234},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18567323684692383}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6496447920799255},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6435443758964539},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5671866536140442},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.477543443441391},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4406864643096924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40363481640815735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33179113268852234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18567323684692383}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/074/04","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/04","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.1375","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.1375","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.ira.uka.de/extra/publications/dhmsw-hpmlr-09.pdf","raw_type":"text"},{"id":"mag:2129154450","is_oa":false,"landing_page_url":"https://i11www.iti.uni-karlsruhe.de/extra/publications/dhmsw-hpmlr-09.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W1493214567","https://openalex.org/W1520740947","https://openalex.org/W1528485123","https://openalex.org/W1559814459","https://openalex.org/W1561240874","https://openalex.org/W1740620250","https://openalex.org/W1866249310","https://openalex.org/W2038643780","https://openalex.org/W2101923813","https://openalex.org/W2103776069","https://openalex.org/W2139539792","https://openalex.org/W2149964853","https://openalex.org/W2151400766","https://openalex.org/W2152545366","https://openalex.org/W2154356512","https://openalex.org/W2169528473","https://openalex.org/W2261186745"],"related_works":["https://openalex.org/W2168148394","https://openalex.org/W2014889099","https://openalex.org/W2114488974","https://openalex.org/W2609578772","https://openalex.org/W2575116237","https://openalex.org/W2169528473","https://openalex.org/W2152545366","https://openalex.org/W2150418461","https://openalex.org/W2113276858","https://openalex.org/W190901240","https://openalex.org/W1493214567","https://openalex.org/W3081852366","https://openalex.org/W3088025102","https://openalex.org/W3183688096","https://openalex.org/W2946564432","https://openalex.org/W2949552662","https://openalex.org/W2188786133","https://openalex.org/W2272766263","https://openalex.org/W2950562895","https://openalex.org/W2775518472"],"abstract_inverted_index":{"Shortest-path":[0],"computation":[1],"is":[2,14,131,146,186],"a":[3,15,26,58,100,109,117,183],"frequent":[4],"task":[5],"in":[6,91,176],"practice.":[7],"Owing":[8],"to":[9,31,47,74,81,108,188],"ever-growing":[10],"real-world":[11],"graphs,":[12,153],"there":[13],"constant":[16],"need":[17],"for":[18],"faster":[19],"algorithms.":[20],"In":[21],"the":[22,44,62,75,88,125,128,139,169],"course":[23],"of":[24,29,57,61,67,127,141,174],"time,":[25,160],"large":[27],"number":[28,140],"techniques":[30],"heuristically":[32],"speed":[33],"up":[34],"Dijkstra\u2019s":[35],"shortest-path":[36,49],"algorithm":[37,167],"have":[38],"been":[39],"devised.":[40],"This":[41,145],"work":[42],"reviews":[43],"multi-level":[45],"technique":[46],"answer":[48,99],"queries":[50],"exactly":[51],"[24,":[52],"9],":[53],"which":[54,112],"makes":[55],"use":[56],"hierarchical":[59],"decomposition":[60],"input":[63],"graph":[64,130],"and":[65,77,94,119,159,162],"precomputation":[66],"supplementary":[68],"information.":[69],"We":[70],"develop":[71],"this":[72,83,190],"preprocessing":[73,185],"maximum":[76],"introduce":[78],"several":[79,156],"ideas":[80],"enhance":[82],"approach":[84],"considerably,":[85],"by":[86,116,148],"reorganizing":[87],"precomputed":[89],"data":[90],"partial":[92,104,142],"graphs":[93,105,143],"optimizing":[95],"them":[96],"individually.":[97],"To":[98],"given":[101],"query,":[102],"certain":[103],"are":[106],"combined":[107],"search":[110,129],"graph,":[111],"can":[113],"be":[114],"explored":[115],"simple":[118],"fast":[120],"procedure.":[121],"The":[122],"concept":[123],"behind":[124],"construction":[126],"such":[132],"that":[133],"query":[134,166,191],"times":[135],"depend":[136],"mainly":[137],"on":[138],"included.":[144],"confirmed":[147],"experiments":[149],"with":[150],"different":[151],"road":[152],"each":[154],"containing":[155],"million":[157],"vertices,":[158],"distance,":[161],"unit":[163],"metrics.":[164],"Our":[165],"computes":[168],"distance":[170],"between":[171],"any":[172],"pair":[173],"vertices":[175],"no":[177],"more":[178],"than":[179],"40":[180],"\u00b5s,":[181],"however,":[182],"lengthy":[184],"required":[187],"achieve":[189],"performance.":[192]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}