When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2018.68
URN: urn:nbn:de:0030-drops-95313
Go to the corresponding LIPIcs Volume Portal

Probst, Maximilian

On the Complexity of the (Approximate) Nearest Colored Node Problem

LIPIcs-ESA-2018-68.pdf (0.6 MB)


Given a graph G=(V,E) where each vertex is assigned a color from the set C={c_1, c_2, .., c_sigma}. In the (approximate) nearest colored node problem, we want to query, given v in V and c in C, for the (approximate) distance dist^(v, c) from v to the nearest node of color c. For any integer 1 <= k <= log n, we present a Color Distance Oracle (also often referred to as Vertex-label Distance Oracle) of stretch 4k-5 using space O(kn sigma^{1/k}) and query time O(log{k}). This improves the query time from O(k) to O(log{k}) over the best known Color Distance Oracle by Chechik [Chechik, 2012]. We then prove a lower bound in the cell probe model showing that even for unweighted undirected paths any static data structure that uses space S requires at least Omega (log (log{sigma} / log(S/n)+log log{n})) query time to give a distance estimate of stretch O(polylog(n)). This implies for the important case when sigma = Theta(n^{epsilon}) for some constant 0 < epsilon < 1, that our Color Distance Oracle has asymptotically optimal query time in regard to k, and that recent Color Distance Oracles for trees [Tsur, 2018] and planar graphs [Mozes and Skop, 2018] achieve asymptotically optimal query time in regard to n. We also investigate the setting where the data structure additionally has to support color-reassignments. We present the first Color Distance Oracle that achieves query times matching our lower bound from the static setting for large stretch yielding an exponential improvement over the best known query time [Chechik, 2014]. Finally, we give new conditional lower bounds proving the hardness of answering queries if edge insertions and deletion are allowed that strictly improve over recent bounds in time and generality.

BibTeX - Entry

  author =	{Maximilian Probst},
  title =	{{On the Complexity of the (Approximate) Nearest Colored Node Problem}},
  booktitle =	{26th Annual European Symposium on Algorithms (ESA 2018)},
  pages =	{68:1--68:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-081-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{112},
  editor =	{Yossi Azar and Hannah Bast and Grzegorz Herman},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-95313},
  doi =		{10.4230/LIPIcs.ESA.2018.68},
  annote =	{Keywords: Nearest Colored Node, Distance Oracles, Cell-probe lower bounds}

Keywords: Nearest Colored Node, Distance Oracles, Cell-probe lower bounds
Seminar: 26th Annual European Symposium on Algorithms (ESA 2018)
Issue Date: 2018
Date of publication: 08.08.2018

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