Recommendations
Cited in
(45)- Shortest path calculation in large road networks
- Sublinear search spaces for shortest path planning in grid and road networks
- Quickest path queries on transportation network
- Fast paths in large-scale dynamic road networks
- GRASP. Extending graph separators for the single-source shortest-path problem
- PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies
- Levelwise mesh sparsification for shortest path queries
- Algorithm engineering for route planning: an update
- Highway dimension and provably efficient shortest path algorithms
- The shortest path problem on large-scale real-road networks
- Lower bounds in the preprocessing and query phases of routing algorithms
- Provable efficiency of contraction hierarchies with randomized preprocessing
- Compressing optimal paths with run length encoding
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Partitioning graphs to speedup Dijkstra's algorithm
- Preprocessing speed-up techniques is hard
- An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
- 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
- The Shortcut Problem – Complexity and Approximation
- Engineering Route Planning Algorithms
- Car or Public Transport—Two Worlds
- Encoding shortest paths in spatial networks
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- Aggregation of Markov flows I: theory
- Shortest-path queries in static networks
- Rule based shortest path query algorithm
- Fast shortest-path distance queries on road networks by pruned highway labeling
- Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
- Route planning with flexible objective functions
- The shortest-path problem. Analysis and comparison of methods
- 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
- Engineering highway hierarchies
- Highway dimension, shortest paths, and provably efficient algorithms
- Time-dependent SHARC-routing
- Algorithms – ESA 2005
- A novel pseudo‐polynomial approach for shortest path problems
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- Distance closures: unifying search- and lookup-based shortest path speedup techniques
- Optimal forks: preprocessing single-source shortest path instances with interval data
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 Q5449583)
