Engineering Oracles for Time-Dependent Road Networks

DOI10.1137/1.9781611974317.1zbMath1430.68224arXiv1511.08303OpenAlexW2963732503MaRDI QIDQ5232540

Dorothea Wagner, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Christos D. Zaroliagis, Spyros C. Kontogiannis

Publication date: 12 September 2019

Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08303

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Traffic problems in operations research (90B20) Data structures (68P05)

Related Items (2)

Space-efficient, fast and exact routing in time-dependent road networks ⋮ An axiomatic approach to time-dependent shortest path oracles

This page was built for publication: Engineering Oracles for Time-Dependent Road Networks