Exact Routing in Large Road Networks Using Contraction Hierarchies
By Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter. 2012
393 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Signal Processing
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
- Andrew Vladislav Goldberg
- Renato F. Werneck
- Daniel Delling
- Peter Sanders
- Dorothea Wagner
- Matthias Müller-Hannemann
- Hannah Bast
- Thomas Pajor
In Computer Vision and Pattern Recognition
- Daniel Delling
- Andrew Vladislav Goldberg
- Renato F. Werneck
- Ekim Yurtsever
- Alexander Carballo
- Jacob Lambert
- Peter Sanders
- Dorothea Wagner
In Signal Processing
- Daniel Delling
- Peter Sanders
- Andrew Vladislav Goldberg
- Renato F. Werneck
- Dorothea Wagner
- Jacob Lambert
- Alexander Carballo
- Kazuya Takeda
Citations in the corpus
- A Survey of Autonomous Driving: Common Practices and Emerging Technologies (2019, methodology): “Contraction Hierarchies (CH) method was proposed in [247]”
- A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles (2016, neutral): “4”
- Route Planning in Transportation Networks (2015, methodology): “This approach has been tried for various techniques, including Geometric Containers [251], ALT [96], Arc Flags [66], and CH [142,234], with varying degrees of success.”
- Most reliable path-finding algorithm for maximizing on-time arrival probability (2017, methodology): “Following the pioneering work of Dijkstra (1959), several efficient solution algorithms and data structures have been developed for solving shortest path problems with deterministic link costs (Bast et al. 2007; Geisberger et al. 2012; Li et al. 2015).”
- Self-Driving Cars: A Survey (2019, methodology): “CH (Contraction Hierarchies) algorithm [GEI12] is a hierarchical technique that implements the idea of creating shortcuts to skip vertices with low importance.”