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.ITCS.2019.58
URN: urn:nbn:de:0030-drops-101510
URL: https://drops.dagstuhl.de/opus/volltexte/2018/10151/
 Go to the corresponding LIPIcs Volume Portal

Local Computation Algorithms for Spanners

 pdf-format:

Abstract

A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known existential size-stretch trade-off efficiently.
Classical models and algorithmic analysis of graph spanners essentially assume that the algorithm can read the input graph, construct the desired spanner, and write the answer to the output tape. However, when considering massive graphs containing millions or even billions of nodes not only the input graph, but also the output spanner might be too large for a single processor to store.
To tackle this challenge, we initiate the study of local computation algorithms (LCAs) for graph spanners in general graphs, where the algorithm should locally decide whether a given edge (u,v) in E belongs to the output (sparse) spanner or not. Such LCAs give the user the "illusion" that a specific sparse spanner for the graph is maintained, without ever fully computing it. We present several results for this setting, including:
- For general n-vertex graphs and for parameter r in {2,3}, there exists an LCA for (2r-1)-spanners with O~(n^{1+1/r}) edges and sublinear probe complexity of O~(n^{1-1/2r}). These size/stretch trade-offs are best possible (up to polylogarithmic factors).
- For every k >= 1 and n-vertex graph with maximum degree Delta, there exists an LCA for O(k^2) spanners with O~(n^{1+1/k}) edges, probe complexity of O~(Delta^4 n^{2/3}), and random seed of size polylog(n). This improves upon, and extends the work of [Lenzen-Levi, ICALP'18].
We also complement these constructions by providing a polynomial lower bound on the probe complexity of LCAs for graph spanners that holds even for the simpler task of computing a sparse connected subgraph with o(m) edges.
To the best of our knowledge, our results on 3 and 5-spanners are the first LCAs with sublinear (in Delta) probe-complexity for Delta = n^{Omega(1)}.

BibTeX - Entry

```@InProceedings{parter_et_al:LIPIcs:2018:10151,
author =	{Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee},
title =	{{Local Computation Algorithms for Spanners}},
booktitle =	{10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)},
pages =	{58:1--58:21},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-095-8},
ISSN =	{1868-8969},
year =	{2018},
volume =	{124},
editor =	{Avrim Blum},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address =	{Dagstuhl, Germany},
URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/10151},
URN =		{urn:nbn:de:0030-drops-101510},
doi =		{10.4230/LIPIcs.ITCS.2019.58},
annote =	{Keywords: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners}
}
```

 Keywords: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners Collection: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) Issue Date: 2018 Date of publication: 08.01.2019

DROPS-Home | Fulltext Search | Imprint | Privacy