Improved approximation for time-dependent shortest paths
DOI10.1007/978-3-319-08783-2_39zbMATH Open1425.68458OpenAlexW43621356WikidataQ62037422 ScholiaQ62037422MaRDI QIDQ2920481FDOQ2920481
Authors: Masoud T. Omran, Jörg-Rüdiger Sack 
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_39
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25) Paths and cycles (05C38)
Cited In (14)
- Computation of the optimal value function in time-dependent networks
- An A* algorithm framework for the point-to-point time-dependent shortest path problem
- The piecewise constant/linear solution for dynamic user equilibrium
- An axiomatic approach to time-dependent shortest path oracles
- Engineering time-dependent many-to-many shortest paths computation
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
- Polynomial-time approximation schemes for shortest path with alternatives
- Approximation solutions for time-varying shortest path problem
- On the complexity of time-dependent shortest paths
- On the complexity of time-dependent shortest paths
- On the approximability of time disjoint walks
- Title not available (Why is that?)
- Shortest paths in time-dependent FIFO networks
- The time-dependent quickest path problem: properties and bounds
This page was built for publication: Improved approximation for time-dependent shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920481)
