Reach for A^*: shortest path algorithms with preprocessing
From MaRDI portal
Publication:3574264
zbMATH Open1204.90112MaRDI QIDQ3574264FDOQ3574264
Authors: Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck 
Publication date: 9 July 2010
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cited In (17)
- PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies
- Candidate sets for alternative routes in road networks
- The shortest-path problem. Analysis and comparison of methods
- Computing the shortest path: \(A^\ast\) search meets graph theory
- Dynamic graph generation for the shortest path problem in time expanded networks
- Precomputation techniques for the stochastic on-time arrival problem
- Point-to-Point Shortest Path Algorithms with Preprocessing
- Shortest-path queries in static networks
- Preprocessing speed-up techniques is hard
- VC-dimension and shortest path algorithms
- Goal-directed shortest-path queries using precomputed cluster distances
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- Core routing on dynamic time-dependent road networks
- The compressed differential heuristic
- An efficient lower-bounding approach to point-to-point shortest path problem
- GRASP. Extending graph separators for the single-source shortest-path problem
- Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
This page was built for publication: Reach for \(A^*\): shortest path algorithms with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574264)
