Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
By Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling. Workshop on Engineering Applications, 2008
855 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/9a77ae6193a524f25ec60835c7f2b599210347ef
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Daniel Delling
- Christian Vetter
- Peter Sanders
- Robert Geisberger
- Dominik Schultes
- Dorothea Wagner
- Andrew Vladislav Goldberg
- Renato F. Werneck
In Signal Processing
- Daniel Delling
- Christian Vetter
- Peter Sanders
- Robert Geisberger
- Dominik Schultes
- Dorothea Wagner
- Andrew Vladislav Goldberg
- Renato F. Werneck
Citations in the corpus
- Engineering Route Planning Algorithms (2009, background): “(eco) [23] 01/08 [23] 18 21 10 28 350 CH + edge flags (aggr) [8] 01/08 [8] 18 32 99 371 882 CH + edge flags (eco) [8] 01/08 [8] 18 20 32 143 682 transit nodes + edge flags [8] 01/08 [8] 18 341 229 3 327 372 contr.”
- Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, background): “CHs, first introduced by [Geisberger et al. 2008b], are an extreme case of the hierarchies in highway-node routing (HNR) by [Schultes and Sanders 2007] – every node defines its own level of the hierarchy.”
- Real-time routing with OpenStreetMap data (2011, background): “Contraction Hi-erarchies (CH) [4] have a very convenient trade-off between preprocessing and query time.”