Time-Dependent Approximate Distance Oracles

<p style="margin: 0px;">We present the first approximate distance oracle for sparse directed graphs with time-dependent arc-travel-times, which assures polynomial time-complexity and subquadratic space-complexity of the preprocessing phase, while the query-phase has sublinear time-complexity. The arc-travel-times are determined by continuous, piecewise linear, positive functions.</p>