On the probe complexity of local computation algorithms

Uriel Feige, Boaz Patt-Shamir, Shai Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the Local Computation Algorithms (LCA) model, the algorithm is asked to compute a part of the output by reading as little as possible from the input. For example, an LCA for coloring a graph is given a vertex name (as a “query”), and it should output the color assigned to that vertex after inquiring about some part of the graph topology using “probes”; all outputs must be consistent with the same coloring. LCAs are useful when the input is huge, and the output as a whole is not needed simultaneously. Most previous work on LCAs was limited to bounded-degree graphs, which seems inevitable because probes are of the form “what vertex is at the other end of edge i of vertex v?”. In this work we study LCAs for unbounded-degree graphs. In particular, such LCAs are expected to probe the graph a number of times that is significantly smaller than the maximum, average, or even minimum degree. We show that there are problems that have very e cient LCAs on any graph - specifically, we show that there is an LCA for the weak coloring problem (where a coloring is legal if every vertex has a neighbor with a di erent color) that uses log n + O(1) probes to reply to any query. As another way of dealing with large degrees, we propose a more powerful type of probe which we call a strong probe: given a vertex name, it returns a list of its neighbors. Lower bounds for strong probes are stronger than ones in the edge probe model (which we call weak probes). Our main result in this model is that roughly (n) strong probes are required to compute a maximal matching. Our findings include interesting separations between closely related problems. For weak probes, we show that while weak 3-coloring can be done with probe complexity log n + O(1), weak 2-coloring has probe complexity (log n/log log n). For strong probes, our negative result for maximal matching is complemented by an LCA for (1 − )-approximate maximum matching on regular graphs that uses O(1) strong probes, for any constant > 0.

Original languageEnglish
Title of host publication45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
EditorsChristos Kaklamanis, Daniel Marx, Ioannis Chatzigiannakis, Donald Sannella
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770767
DOIs
StatePublished - 1 Jul 2018
Event45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 - Prague, Czech Republic
Duration: 9 Jul 201813 Jul 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume107
ISSN (Print)1868-8969

Conference

Conference45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
Country/TerritoryCzech Republic
CityPrague
Period9/07/1813/07/18

Keywords

  • Local computation algorithms
  • Sublinear algorithms

Fingerprint

Dive into the research topics of 'On the probe complexity of local computation algorithms'. Together they form a unique fingerprint.

Cite this