License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2016.47
URN: urn:nbn:de:0030-drops-68170
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6817/
Go to the corresponding LIPIcs Volume Portal

Kontogiannis, Spyros ; Wagner, Dorothea ; Zaroliagis, Christos

Hierarchical Time-Dependent Oracles

pdf-format:
LIPIcs-ISAAC-2016-47.pdf (0.7 MB)

Abstract

We study networks obeying time-dependent min-cost path metrics, and present novel oracles for them which provably achieve two unique features: (i) subquadratic preprocessing time and space, independent of the metric’s amount of disconcavity; (ii) sublinear query time, in either the network size or the actual Dijkstra-Rank of the query at hand.

BibTeX - Entry

@InProceedings{kontogiannis_et_al:LIPIcs:2016:6817,
  author =	{Spyros Kontogiannis and Dorothea Wagner and Christos Zaroliagis},
  title =	{{Hierarchical Time-Dependent Oracles}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{47:1--47:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Seok-Hee Hong},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6817},
  URN =		{urn:nbn:de:0030-drops-68170},
  doi =		{10.4230/LIPIcs.ISAAC.2016.47},
  annote =	{Keywords: Time-dependent shortest paths, FIFO property, Distance oracles}
}

Keywords: Time-dependent shortest paths, FIFO property, Distance oracles
Collection: 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Issue Date: 2016
Date of publication: 07.12.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI