An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Distributed discovery of large near-cliques
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Property testing
Sublinear graph approximation algorithms
Property testing
Property testing
Sublinear graph approximation algorithms
Property testing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing
An efficient partitioning oracle for bounded-treewidth graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Discrete Mathematics
Constant-Time approximation algorithms for the knapsack problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Constant-time algorithms for sparsity matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Converting online algorithms to local computation algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
No sublogarithmic-time approximation scheme for bipartite vertex cover
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Lower bounds for local approximation
Journal of the ACM (JACM)
Limits of local algorithms over sparse random graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applicable to a certain subclass of algorithms that compute a solution in a constant number of phases. The technique is based on greedily considering local improvements in random order.The problems amenable to our technique include Vertex Cover, Maximum Matching, Maximum Weight Matching, Set Cover, and Minimum Dominating Set. For example, for Maximum Matching, we give the first constant-time algorithm that for the class of graphs of degree bounded by $d$, computes the maximum matching size to within $\eps n$, for any $\eps 0$, where $n$ is the number of nodes in the graph. The running time of the algorithm is independent of $n$, and only depends on $d$ and $\eps$.