An axiomatic approach to time-dependent shortest path oracles
From MaRDI portal
Publication:2118212
Recommendations
Cites work
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- An Appraisal of Some Shortest-Path Algorithms
- Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
- Approximate distance oracles
- Approximate distance oracles with improved preprocessing time
- Approximate distance oracles with improved query time
- Bidirectional \(A^*\) search on time-dependent road networks
- Design and implementation of an efficient priority queue
- Distance Oracles for Sparse Graphs
- Distance Oracles for Stretch Less Than 2
- Engineering oracles for time-dependent road networks
- Fast, precise and dynamic distance queries
- Hierarchical time-dependent oracles
- Improved approximation for time-dependent shortest paths
- Minimum time-dependent travel times with contraction hierarchies
- On the complexity of time-dependent shortest paths
- Preprocess, set, query!
- Preserving order in a forest in less than logarithmic time and linear space
- Shortest paths in time-dependent FIFO networks
- Shortest route with time dependent length of edges and limited delay possibilities in nodes
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Shortest-path queries in static networks
- The shortest route through a network with time-dependent internodal transit times
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- Time-dependent SHARC-routing
- Time-dependent route planning
Cited in
(2)
This page was built for publication: An axiomatic approach to time-dependent shortest path oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118212)
