Hierarchical Time-Dependent Oracles
Data Structures and Algorithms
2016-07-04 v4
Abstract
We study networks obeying \emph{time-dependent} min-cost path metrics, and present novel oracles for them which \emph{provably} achieve two unique features: % (i) \emph{subquadratic} preprocessing time and space, \emph{independent} of the metric's amount of disconcavity; % (ii) \emph{sublinear} query time, in either the network size or the actual Dijkstra-Rank of the query at hand.
Cite
@article{arxiv.1502.05222,
title = {Hierarchical Time-Dependent Oracles},
author = {Spyros Kontogiannis and Dorothea Wagner and Christos Zaroliagis},
journal= {arXiv preprint arXiv:1502.05222},
year = {2016}
}