Analysis and Experimental Evaluation of Time-Dependent Distance Oracles

DOI10.1137/1.9781611973754.13MaRDI QIDQ5232533zbMATH OpenOpenAlexFDO

Authors George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Spyros Kontogiannis, Christos Zaroliagis

Publication date 12 September 2019

Published in 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1648793e98d7409af2356b6eb7ce1d4ab7132a4b

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1979513
• Approximate distance oracles with constant query time
• The space-stretch-time tradeoff in distance oracles
• Approximate distance oracles with improved preprocessing time
• Approximate distance oracles with improved query time
• Approximating approximate distance oracles
• Improved distance sensitivity oracles with subcubic preprocessing time

Cited in

(8)

• An axiomatic approach to time-dependent shortest path oracles
• scientific article; zbMATH DE number 6712240 (Why is no real title available?)
• Personal routes with high-dimensional costs and dynamic approximation guarantees
• Hierarchical time-dependent oracles
• Minimum time-dependent travel times with contraction hierarchies
• Engineering oracles for time-dependent road networks
• Improved oracles for time-dependent road networks
• Time-dependent alternative route planning

This page was built for publication: Analysis and Experimental Evaluation of Time-Dependent Distance Oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232533)