{"id":"https://openalex.org/W2461311369","doi":"https://doi.org/10.1145/2985473","title":"Highway Dimension and Provably Efficient Shortest Path Algorithms","display_name":"Highway Dimension and Provably Efficient Shortest Path Algorithms","publication_year":2016,"publication_date":"2016-12-08","ids":{"openalex":"https://openalex.org/W2461311369","doi":"https://doi.org/10.1145/2985473","mag":"2461311369"},"language":"en","primary_location":{"id":"doi:10.1145/2985473","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2985473","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/A5078682514","display_name":"Ittai Abraham","orcid":"https://orcid.org/0000-0001-9568-7674"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ittai Abraham","raw_affiliation_strings":["Microsoft Research Silicon Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060646771","display_name":"Daniel Delling","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Daniel Delling","raw_affiliation_strings":["Microsoft Research Silicon Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038118929","display_name":"Amos Fiat","orcid":"https://orcid.org/0000-0002-5748-9519"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amos Fiat","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Microsoft Research Silicon Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063407134","display_name":"Renato F. Werneck","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Renato F. Werneck","raw_affiliation_strings":["Microsoft Research Silicon Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5078682514"],"corresponding_institution_ids":["https://openalex.org/I4210124949"],"apc_list":null,"apc_paid":null,"fwci":4.338,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.95125814,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"63","issue":"5","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6621618270874023},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6332510113716125},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6301122903823853},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5713703036308289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5659220218658447},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5163706541061401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5034543871879578},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4931883215904236},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.48556920886039734},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.46481117606163025},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4372609257698059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42523038387298584},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4170331358909607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28979313373565674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23557895421981812},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1353730857372284},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07239046692848206}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6621618270874023},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6332510113716125},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6301122903823853},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5713703036308289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5659220218658447},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5163706541061401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5034543871879578},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4931883215904236},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.48556920886039734},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.46481117606163025},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4372609257698059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42523038387298584},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4170331358909607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28979313373565674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23557895421981812},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1353730857372284},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07239046692848206},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2985473","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2985473","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W63579610","https://openalex.org/W82786942","https://openalex.org/W85521454","https://openalex.org/W190901240","https://openalex.org/W200191397","https://openalex.org/W594249513","https://openalex.org/W1513400187","https://openalex.org/W1567597852","https://openalex.org/W1573579329","https://openalex.org/W1581442026","https://openalex.org/W1601313669","https://openalex.org/W1769399376","https://openalex.org/W1920501755","https://openalex.org/W1977943748","https://openalex.org/W1993643838","https://openalex.org/W1994924587","https://openalex.org/W2009303970","https://openalex.org/W2014889099","https://openalex.org/W2022671649","https://openalex.org/W2029538739","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2036159029","https://openalex.org/W2040924621","https://openalex.org/W2041172083","https://openalex.org/W2058787216","https://openalex.org/W2062519180","https://openalex.org/W2069916913","https://openalex.org/W2071717275","https://openalex.org/W2071974437","https://openalex.org/W2072485026","https://openalex.org/W2083019227","https://openalex.org/W2084224084","https://openalex.org/W2084736709","https://openalex.org/W2088836486","https://openalex.org/W2097307233","https://openalex.org/W2101923813","https://openalex.org/W2112513979","https://openalex.org/W2113276858","https://openalex.org/W2122844470","https://openalex.org/W2127248062","https://openalex.org/W2128678576","https://openalex.org/W2143083884","https://openalex.org/W2146583842","https://openalex.org/W2150418461","https://openalex.org/W2153374077","https://openalex.org/W2157054705","https://openalex.org/W2159320012","https://openalex.org/W2169528473","https://openalex.org/W2171574770","https://openalex.org/W2397920857","https://openalex.org/W2561675875","https://openalex.org/W2571933368","https://openalex.org/W2575116237","https://openalex.org/W2576197549","https://openalex.org/W2579664199","https://openalex.org/W2609578772","https://openalex.org/W2621446776","https://openalex.org/W2995414748","https://openalex.org/W4238284510","https://openalex.org/W6634264458"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W3046370962"],"abstract_inverted_index":{"Computing":[0],"driving":[1],"directions":[2],"has":[3],"motivated":[4],"many":[5],"shortest":[6,181],"path":[7],"algorithms":[8,38,121],"based":[9,167],"on":[10,168],"preprocessing.":[11],"Given":[12],"a":[13,19,54,141,152,169],"graph,":[14],"the":[15,36,44,58,65,69,78,83,95,101,104,113,132,137,156],"preprocessing":[16,125],"stage":[17],"computes":[18],"modest":[20],"amount":[21],"of":[22,57,73,77,97,158,174,186],"auxiliary":[23,134],"data,":[24],"which":[25,93,189],"is":[26,107],"then":[27],"used":[28],"to":[29,43],"speed":[30],"up":[31],"online":[32],"queries.":[33],"In":[34,60],"practice,":[35],"best":[37,164],"have":[39],"storage":[40,138],"overhead":[41],"comparable":[42],"graph":[45,114],"size":[46],"and":[47,144],"answer":[48],"queries":[49,145],"very":[50],"fast,":[51],"while":[52],"examining":[53],"small":[55],"fraction":[56],"graph.":[59],"this":[61],"article,":[62],"we":[63,116,177],"complement":[64],"experimental":[66],"evidence":[67],"with":[68],"first":[70],"rigorous":[71],"proofs":[72],"efficiency":[74],"for":[75,119,155],"some":[76,120],"speedup":[79],"techniques":[80],"developed":[81],"over":[82],"past":[84],"decade":[85],"or":[86,122],"variations":[87],"thereof.":[88],"We":[89],"define":[90],"highway":[91,105],"dimension,":[92],"strengthens":[94],"notion":[96],"doubling":[98],"dimension.":[99],"Under":[100],"assumption":[102],"that":[103,171,179],"dimension":[106],"low":[108,187],"(at":[109],"most":[110],"polylogarithmic":[111,142,148],"in":[112,129,147],"size),":[115],"show":[117,178],"that,":[118],"their":[123],"variants,":[124],"can":[126],"be":[127,173],"implemented":[128],"polynomial":[130],"time,":[131],"resulting":[133],"data":[135],"increases":[136],"requirements":[139],"by":[140],"factor,":[143],"run":[146],"time.":[149],"This":[150],"gives":[151],"unified":[153],"explanation":[154],"performance":[157],"several":[159],"seemingly":[160],"different":[161],"approaches.":[162],"Our":[163],"bounds":[165],"are":[166],"result":[170],"may":[172],"independent":[175],"interest:":[176],"unique":[180],"paths":[182],"induce":[183],"set":[184],"systems":[185],"VC-dimension,":[188],"makes":[190],"them":[191],"combinatorially":[192],"simple.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}