Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
From MaRDI portal
Publication:3506418
DOI10.1007/978-3-540-68552-4_24zbMath1430.68208OpenAlexW2148831787MaRDI QIDQ3506418
Robert Geisberger, Daniel Delling, Dominik Schultes, Peter Sanders
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
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Traffic problems in operations research (90B20)
Related Items (22)
Conflict-tolerant and conflict-free multi-agent meeting ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Generating constrained length personalized bicycle tours ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ The compressed differential heuristic ⋮ VC-Dimension and Shortest Path Algorithms ⋮ PACE Solver Description: Tree Depth with FlowCutter ⋮ Shortest-path queries in static networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Engineering Route Planning Algorithms ⋮ Fast optimal and bounded suboptimal Euclidean pathfinding ⋮ User-Constrained Multimodal Route Planning ⋮ Car or Public Transport—Two Worlds ⋮ Finding the shortest path with vertex constraint over large graphs ⋮ Unnamed Item ⋮ Regarding Goal Bounding and Jump Point Search ⋮ Unnamed Item ⋮ ReHub ⋮ Customizable Contraction Hierarchies ⋮ Solving the Watchman Route Problem with Heuristic Search ⋮ Computing Constrained Shortest-Paths at Scale
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
This page was built for publication: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
