Hierarchical hub labelings for shortest paths

Authors:
Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck
Affiliations:
Microsoft Research Silicon Valley;Microsoft Research Silicon Valley;Microsoft Research Silicon Valley;Microsoft Research Silicon Valley
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 14
Cited 11

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
Distance labeling in graphs

Journal of Algorithms
A Practical Shortest Path Algorithm with Linear Expected Time

SIAM Journal on Computing
Efficient traversal of mesh edges using adjacency primitives

ACM SIGGRAPH Asia 2008 papers
On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

Journal of Experimental Algorithmics (JEA)
Highway dimension, shortest paths, and provably efficient algorithms

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Customizable route planning

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
Distributed time-dependent contraction hierarchies

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science

HLDB: location-based services in databases

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Fast exact shortest-path distance queries on large networks by pruned landmark labeling

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
G-tree: an efficient index for KNN search on road networks

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths

Proceedings of the first ACM conference on Online social networks
Call me maybe: understanding nature and risks of sharing mobile numbers on online social networks

Proceedings of the first ACM conference on Online social networks
Customizable point-of-interest queries in road networks

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for hub label optimization

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)
Optimizing Landmark-Based Routing and Preprocessing

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
IS-Label: an independent-set based labeling scheme for point-to-point distance querying

Proceedings of the VLDB Endowment
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

Proceedings of the 23rd international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed.