Constant-Time Approximation Algorithms via Local Improvements

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 epsivn, for any epsivn > 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 epsiv.

[1]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[2]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[3]  Piotr Indyk,et al.  Sublinear time algorithms for metric space problems , 1999, STOC '99.

[4]  Andrzej Czygrinow,et al.  A Fast Distributed Algorithm for Approximating the Maximum Matching , 2004, ESA.

[5]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[6]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[7]  Piotr Indyk,et al.  Facility Location in Sublinear Time , 2005, ICALP.

[8]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Artur Czumaj,et al.  Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time , 2009, SIAM J. Comput..

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Andrzej Czygrinow,et al.  Distributed Algorithm for Better Approximation of the Maximum Matching , 2003, COCOON.

[13]  Peter Sanders,et al.  A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[14]  Dana Ron,et al.  Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.

[15]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[16]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.