Highway dimension, shortest paths, and provably efficient algorithms

Authors:
Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck
Affiliations:
Microsoft Research Silicon Valley;Tel-Aviv University;Microsoft Research Silicon Valley;Microsoft Research Silicon Valley
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 10
Cited 26

Data structures and network algorithms

Data structures and network algorithms
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximate distance oracles

Journal of the ACM (JACM)
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An Optimal Dynamic Spanner for Doubling Metric Spaces

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Synthetic road networks

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On k-skip shortest paths

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Scope-based route planning

ESA'11 Proceedings of the 19th European conference on Algorithms
Exact distance oracles for planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Alternative routes in road networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Shortest path and distance queries on road networks: an experimental evaluation

Proceedings of the VLDB Endowment
Preprocessing speed-up techniques is hard

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A highway-centric labeling approach for answering distance queries on large sparse graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient processing of distance queries in large graphs: a vertex cover approach

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
K-reach: who is in your small world

Proceedings of the VLDB Endowment
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science
Candidate sets for alternative routes in road networks

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap

IEEE/ACM Transactions on Networking (TON)
Hierarchical hub labelings for shortest paths

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
On optimal preprocessing for contraction hierarchies

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Noah: a dynamic ridesharing system

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Shortest path and distance queries on road networks: towards bridging theory and practice

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Search-Space size in contraction hierarchies

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing driving directions has motivated many shortest path heuristics that answer queries on continental scale networks, with tens of millions of intersections, literally instantly, and with very low storage overhead. In this paper we complement the experimental evidence with the first rigorous proofs of efficiency for many of the heuristics suggested over the past decade. We introduce the notion of highway dimension and show how low highway dimension gives a unified explanation for several seemingly different algorithms.