Engineering highway hierarchies
From MaRDI portal
Recommendations
Cited in
(26)- Fast paths in large-scale dynamic road networks
- Candidate sets for alternative routes in road networks
- GRASP. Extending graph separators for the single-source shortest-path problem
- Levelwise mesh sparsification for shortest path queries
- Highway dimension and provably efficient shortest path algorithms
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- High-performance multi-level routing
- Reach for A^*: shortest path algorithms with preprocessing
- scientific article; zbMATH DE number 5734725 (Why is no real title available?)
- Robust, almost constant time shortest-path queries in road networks
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
- Personal routes with high-dimensional costs and dynamic approximation guarantees
- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
- Fast shortest-path distance queries on road networks by pruned highway labeling
- Route planning with flexible objective functions
- Customizable contraction hierarchies
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- Goal-directed shortest-path queries using precomputed cluster distances
- Route planning with flexible edge restrictions
- Highway dimension, shortest paths, and provably efficient algorithms
- Engineering Highway Hierarchies
- Algorithms – ESA 2005
- Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks
- Distance closures: unifying search- and lookup-based shortest path speedup techniques
- More hierarchy in route planning using edge hierarchies
- A multilevel fast marching method for the minimum time problem
This page was built for publication: Engineering highway hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406264)
