Improved Approximation for Time-Dependent Shortest Paths
From MaRDI portal
Publication:2920481
DOI10.1007/978-3-319-08783-2_39zbMath1425.68458OpenAlexW43621356WikidataQ62037422 ScholiaQ62037422MaRDI QIDQ2920481
Jörg-Rüdiger Sack, Masoud T. Omran
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
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (2)
The piecewise constant/linear solution for dynamic user equilibrium ⋮ An axiomatic approach to time-dependent shortest path oracles
This page was built for publication: Improved Approximation for Time-Dependent Shortest Paths
