research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:chita
TitleDistance Oracles for Time-Dependent Networks
Bibtex cite IDRACTI-RU1-2014-33
Booktitle Automata, Languages, and Programming
Series Lecture Notes in Computer Science
Year published 2014
Volume 8572
Number Part I
Pages 713-725
Publisher Springer 2014
Organization ICALP 2014
We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions possessing the FIFO property. Our approach precomputes (1 + å) −approximate distance summaries from selected landmark vertices to all other vertices in the network, and provides two sublinear-time query algorithms that deliver constant and (1 + ó) −approximate shortest-travel-times, respectively, for arbitrary origin-destination pairs in the network. Our oracle is based only on the sparsity of the network, along with two quite natural assumptions about travel-time functions which allow the smooth transition towards asymmetric and time-dependent distance metrics.
Kontogiannis, Spyros
Zaroliagis, Christos
Publication ID1059