Improved approximation for time-dependent shortest paths

DOI10.1007/978-3-319-08783-2_39MaRDI QIDQ2920481zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• On the complexity of time-dependent shortest paths
• On the complexity of time-dependent shortest paths
• Shortest paths in time-dependent FIFO networks
• Approximation solutions for time-varying shortest path problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Cited in

(14)

• The piecewise constant/linear solution for dynamic user equilibrium
• Engineering time-dependent many-to-many shortest paths computation
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• Shortest paths in time-dependent FIFO networks
• An axiomatic approach to time-dependent shortest path oracles
• Approximation solutions for time-varying shortest path problem
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Computation of the optimal value function in time-dependent networks
• On the complexity of time-dependent shortest paths
• The time-dependent quickest path problem: properties and bounds
• Polynomial-time approximation schemes for shortest path with alternatives
• An A* algorithm framework for the point-to-point time-dependent shortest path problem
• On the approximability of time disjoint walks
• On the complexity of time-dependent shortest paths

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)