Fast Local Computation Algorithms
arXiv:1104.1377
Abstract
For input , let denote the set of outputs that are the "legal" answers for a computational problem . Suppose and members of are so large that there is not time to read them in their entirety. We propose a model of {\em local computation algorithms} which for a given input , support queries by a user to values of specified locations in a legal output . When more than one legal output exists for a given , the local computation algorithm should output in a way that is consistent with at least one such . Local computation algorithms are intended to distill the common features of several concepts that have appeared in various algorithmic subfields, including local distributed computation, local algorithms, locally decodable codes, and local reconstruction. We develop a technique, based on known constructions of small sample spaces of -wise independent random variables and Beck's analysis in his algorithmic approach to the Lov{á}sz Local Lemma, which under certain conditions can be applied to construct local computation algorithms that run in {\em polylogarithmic} time and space. We apply this technique to maximal independent set computations, scheduling radio network broadcasts, hypergraph coloring and satisfying -SAT formulas.
A preliminary version of this paper appeared in ICS 2011, pp. 223-238
Cited by in corpus (10)
- The Locality of Distributed Symmetry Breaking
- Federated Bandit: A Gossiping Approach
- A Local Computation Approximation Scheme to Maximum Matching
- Provably efficient, succinct, and precise explanations
- Learning Concepts Definable in First-Order Logic with Counting
- A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs
- Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
- Spectral Clustering Oracles in Sublinear Time
- Black-box Methods for Restoring Monotonicity