{"id":"https://openalex.org/W47153646","doi":null,"title":"Fast and Exact Shortest Path Queries Using Highway Hierarchies","display_name":"Fast and Exact Shortest Path Queries Using Highway Hierarchies","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W47153646","mag":"47153646"},"language":"en","primary_location":{"id":"mag:47153646","doi":null,"is_oa":false,"landing_page_url":"http://algo2.iti.kit.edu/schultes/hwy/hwyHierarchiesIncomplete.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W47153646"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5067985737","display_name":"Dominik Schultes","orcid":"https://orcid.org/0000-0002-1439-3904","observed_orcids":["https://orcid.org/0000-0002-1439-3904"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominik Schultes","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1439-3904","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Martin H\u00f6lzer","orcid":"https://orcid.org/0000-0001-7090-8717","observed_orcids":["https://orcid.org/0000-0001-7090-8717"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin H\u00f6lzer","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7090-8717","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036002844","display_name":"Domagoj Matijevi\u0107","orcid":"https://orcid.org/0000-0003-3390-9467","observed_orcids":["https://orcid.org/0000-0003-3390-9467"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Domagoj Matijevi\u0107","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3390-9467","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5091644374","display_name":"Frank Schulz","orcid":"https://orcid.org/0000-0002-3144-8479","observed_orcids":["https://orcid.org/0000-0002-3144-8479"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank Schulz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3144-8479","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2114,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87528644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5532000064849854,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5532000064849854,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.2485000044107437,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.05009999871253967,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-queries","display_name":"shortest path queries","score":0.9610000252723694},{"id":"https://openalex.org/keywords/route-planning","display_name":"route planning","score":0.847000002861023},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.9810000061988831},{"id":"https://openalex.org/keywords/data-preprocessing","display_name":"data preprocessing","score":0.6660000085830688},{"id":"https://openalex.org/keywords/hierarchical-graph-representation","display_name":"hierarchical graph representation","score":0.7990000247955322},{"id":"https://openalex.org/keywords/query-acceleration","display_name":"query acceleration","score":0.5410000085830688},{"id":"https://openalex.org/keywords/shortest-path-routing","display_name":"shortest path routing","score":0.3370000123977661}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7965500354766846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7354655861854553},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5998315215110779},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.545531153678894},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5367739200592041},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5163577795028687},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4908014237880707},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4843619763851166},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4784167408943176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4476350247859955},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4369317293167114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.259395956993103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15667209029197693},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08373168110847473},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:47153646","doi":null,"is_oa":false,"landing_page_url":"http://algo2.iti.kit.edu/schultes/hwy/hwyHierarchiesIncomplete.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7250000238418579,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"},{"score":0.7207000255584717,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W127515624","https://openalex.org/W175307687","https://openalex.org/W1493214567","https://openalex.org/W1559814459","https://openalex.org/W1561240874","https://openalex.org/W1566918731","https://openalex.org/W1676999057","https://openalex.org/W1793326553","https://openalex.org/W1866249310","https://openalex.org/W1969483458","https://openalex.org/W1979750070","https://openalex.org/W1996805805","https://openalex.org/W2014889099","https://openalex.org/W2029132631","https://openalex.org/W2045446569","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2089026470","https://openalex.org/W2090747326","https://openalex.org/W2096304547","https://openalex.org/W2096594665","https://openalex.org/W2101923813","https://openalex.org/W2109256116","https://openalex.org/W2159765281","https://openalex.org/W2160365857","https://openalex.org/W2161420356","https://openalex.org/W2166542580","https://openalex.org/W2169528473","https://openalex.org/W2402598023","https://openalex.org/W2570988769","https://openalex.org/W2768149714","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1493214567","https://openalex.org/W7100251577","https://openalex.org/W1583434898","https://openalex.org/W7099204242","https://openalex.org/W7099449600","https://openalex.org/W2571933368","https://openalex.org/W2238062996","https://openalex.org/W2083019227","https://openalex.org/W2132044905"],"abstract_inverted_index":{"The":[0],"computation":[1,151],"of":[2,16,125,132,136,152,164],"shortest":[3],"paths":[4],"in":[5,12,25,95,109,155,175],"a":[6,9,26,35,39,45,73,83,100,115,176],"graph":[7,13],"is":[8,22,129,193],"well-known":[10],"problem":[11],"theory.":[14],"One":[15],"the":[17,62,92,105,133,150,159],"most":[18],"obvious":[19],"practical":[20],"applications":[21],"route":[23,33,88,119],"planning":[24,89,120],"road":[27,47,97,107],"network,":[28],"i.e.,":[29],"finding":[30],"an":[31,130],"optimal":[32,190],"from":[34],"start":[36],"location":[37],"to":[38,68,111,188,208],"target":[40],"location.":[41],"We":[42,81],"assume":[43],"that":[44,55,76,90],"given":[46,106],"network":[48,108],"does":[49],"not":[50],"change":[51],"very":[52],"often":[53],"and":[54,113,158,211],"there":[56],"are":[57,205],"many":[58],"source-target":[59],"queries":[60],"on":[61,149],"same":[63],"network.":[64],"Therefore,":[65],"it":[66],"pays":[67],"invest":[69],"some":[70],"time":[71],"for":[72,87],"preprocessing":[74,101],"step":[75],"accelerates":[77],"all":[78],"further":[79,209],"queries.":[80],"present":[82],"new":[84],"speedup":[85],"technique":[86],"exploits":[91],"hierarchy":[93],"inherent":[94],"real-world":[96],"networks.":[98],"In":[99,144],"step,":[102],"we":[103,147],"investigate":[104],"order":[110],"extract":[112],"prepare":[114],"hierarchical":[116],"representation.":[117],"Our":[118,170],"algorithm":[121,171],"then":[122,183],"takes":[123],"advantage":[124],"this":[126],"data.":[127],"It":[128],"adaptation":[131],"bidirectional":[134],"version":[135],"DIJKSTRA\u2019s":[137,202],"algorithm,":[138],"massively":[139],"restricting":[140],"its":[141],"search":[142],"space.":[143,181],"several":[145],"experiments,":[146],"concentrate":[148],"fastest":[153],"routes":[154],"Western":[156],"Europe":[157],"USA.":[160],"Both":[161],"networks":[162,174],"consist":[163],"about":[165],"20":[166],"million":[167],"nodes":[168],"each.":[169],"preprocesses":[172],"these":[173],"few":[177],"hours":[178],"using":[179,201],"linear":[180],"Queries":[182],"take":[184],"around":[185],"eight":[186],"milliseconds":[187],"produce":[189],"routes.":[191],"This":[192],"more":[194],"than":[195,200],"2":[196],"000":[197],"times":[198],"faster":[199],"algorithm.":[203],"There":[204],"numerous":[206],"possibilities":[207],"improve":[210],"extend":[212],"our":[213],"approach.":[214]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W47153646","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
