Acceleration of shortest path and constrained shortest path computation
From MaRDI portal
Recommendations
- Speed-Up Techniques for Shortest-Path Computations
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Combining speed-up techniques for shortest-path computations
- Speeding up shortest path algorithms
- Computing constrained shortest-paths at scale
- Speeding up dynamic shortest-path algorithms
- Faster algorithms for the shortest path problem
- Solution Algorithms for the Bounded Acceleration Shortest Path Problem
- Computing almost shortest paths
Cited in
(17)- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- A faster computation of the most vital edge of a shortest path
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
- Low-altitude aircraft routing
- Accelerated parallel projection method for solving the shortest distance problem
- A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Combining speed-up techniques for shortest-path computations
- Partitioning graphs to speedup Dijkstra's algorithm
- scientific article; zbMATH DE number 5734722 (Why is no real title available?)
- Engineering Route Planning Algorithms
- Traffic Networks and Flows over Time
- Car or Public Transport—Two Worlds
- Shortest-path queries in static networks
- Time-dependent SHARC-routing
- Exact distance oracles for planar graphs
This page was built for publication: Acceleration of shortest path and constrained shortest path computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710012)
