Constant-time approximation algorithms via local improvements

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 327-336

  Nguyen, Huy N ^a   Onak, Krzysztof ^a  

^a MIT MEDIA LAB   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM MATCHING; MAXIMUM WEIGHT MATCHING; NUMBER OF NODES; OF GRAPHS; OPTIMAL SOLUTIONS; RUNNING TIMES; TIME ALGORITHMS;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; IMAGE RETRIEVAL; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 57949113141     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.81     Document Type: Conference Paper

References (15)

1. M. Badoiu, A. Czumaj, P. Indyk, and C. Sohler. Facility location in sublinear time. In ICALP, pages 866-877, 2005.
2. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. In ICALP, pages 190-200, 2001.
3. A. Czumaj and C. Sohler. Estimating the weight of metric minimum spanning trees in sublinear-time. In STOC, pages 175-183, 2004.
4. A. Czygrinow and M. Hańćkowiak. Distributed algorithm for better approximation of the maximum matching. In COCOON, pages 242-251, 2003.
5. A. Czygrinow, M. Hańćkowiak, and E. Szymańska. A fast distributed algorithm for approximating the maximum matching. In ESA, pages 252-263, 2004.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
7. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002.
8. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973.
9. P. Indyk. Sublinear time algorithms for metric space problems. In STOC, pages 428-434, 1999.
10. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9(3):256-278, 1974.
11. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 980-989, New York, NY, USA, 2006. ACM.
12. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
13. S. Marko and D. Ron. Distance approximation in bounded-degree and general sparse graphs. In APPROXRANDOM, pages 475-486, 2006.
14. M. Parnas and D. Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoretical Computer Science, 381(1-3):183-196, 2007.
15. S. Pettie and P. Sanders. A simpler linear time 2/3-epsilon approximation for maximum weight matching. Inf. Process. Lett., 91(6):271-276, 2004.