Distance Oracles for Time-Dependent Networks

@article{Kontogiannis2015DistanceOF,
  title={Distance Oracles for Time-Dependent Networks},
  author={Spyros C. Kontogiannis and C. Zaroliagis},
  journal={Algorithmica},
  year={2015},
  volume={74},
  pages={1404-1434}
}
  • Spyros C. Kontogiannis, C. Zaroliagis
  • Published 2015
  • Mathematics, Computer Science
  • Algorithmica
  • 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+\varepsilon )$$(1+ε)-approximate distance summaries from selected landmark vertices to all other vertices in the network. Our oracle uses subquadratic space and time preprocessing, and provides two sublinear-time query algorithms that deliver constant and $$(1… CONTINUE READING
    Distance Oracles for Time-Dependent Networks
    9
    Engineering Oracles for Time-Dependent Road Networks
    13
    Hierarchical Oracles for Time-Dependent Networks
    5
    Hierarchical Time-Dependent Oracles
    3
    Time-Dependent Graphs: Definitions, Applications, and Algorithms
    7
    An Introduction to Temporal Graphs: An Algorithmic Perspective*
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 52 REFERENCES
    Distance Oracles for Time-Dependent Networks
    9
    The Space-Stretch-Time Tradeoff in Distance Oracles
    12
    On the Complexity of Time-Dependent Shortest Paths
    82
    Distance Oracles for Stretch Less Than 2
    26
    Shortest Paths in Time-Dependent FIFO Networks
    35
    Shortest-path queries in static networks
    177
    Distance Oracles for Sparse Graphs
    60
    Minimum time-dependent travel times with contraction hierarchies
    73
    Approximate distance oracles with improved preprocessing time
    39