Analysis and Experimental Evaluation of Time-Dependent Distance Oracles

DOI10.1137/1.9781611973754.13zbMath1430.68223OpenAlexW2253723033MaRDI QIDQ5232533

George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Spyros C. Kontogiannis, Christos D. 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

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

Related Items (1)

An axiomatic approach to time-dependent shortest path oracles

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