A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
By Ittai Abraham, Daniel Delling, Andrew Vladislav Goldberg, Renato F. Werneck. The Sea, 2011
302 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Signal Processing
View Paper: https://www.semanticscholar.org/paper/b4eddbaa42a23e837d3e9d692b104f3b67132a21
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Peter Sanders
- Dominik Schultes
- Daniel Delling
- Dorothea Wagner
- Robert Geisberger
- Matthias Müller-Hannemann
- Hannah Bast
- Yoichi Iwata
In Computer Graphics and Computer-Aided Design
In Signal Processing
- Daniel Delling
- Peter Sanders
- Dominik Schultes
- Robert Geisberger
- Christian Vetter
- Andrew Vladislav Goldberg
- Renato F. Werneck
- Dorothea Wagner
Citations in the corpus
- Route Planning in Transportation Networks (2015, background): “[4] have shown that one can obtain good results by defining the label of vertex u as the (upward) search space of a CH query from u (with suboptimal entries removed).”
- Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, background): “Recently, it was shown that using even more preprocessing time and space, one can directly use CHs to achieve the currently fastest query times (Abraham et al. 2011).”
- Fast exact shortest-path distance queries on large networks by pruned landmark labeling (2013, methodology): “Now distance queries on road networks can be processed in less than one microsecond for the complete road network of the USA [1].”