Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
From MaRDI portal
Publication:3506418
DOI10.1007/978-3-540-68552-4_24zbMath1430.68208MaRDI QIDQ3506418
Peter Sanders, Daniel Delling, Dominik Schultes, Robert Geisberger
Publication date: 13 June 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68552-4_24
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90B20: Traffic problems in operations research
Related Items
Shortest-path queries in static networks, Speeding up Martins' algorithm for multiple objective shortest path problems, User-Constrained Multimodal Route Planning, VC-Dimension and Shortest Path Algorithms, Engineering Route Planning Algorithms, Car or Public Transport—Two Worlds
Cites Work
- Unnamed Item
- Fast Routing in Road Networks with Transit Nodes
- SHARC: Fast and Robust Unidirectional Routing
- Better Approximation of Betweenness Centrality
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- Engineering Highway Hierarchies
- Algorithms – ESA 2005
- Experimental and Efficient Algorithms