An improved constant-time approximation algorithm for maximum matchings

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 225-234

  Yoshida, Yuichi ^a   Yamamoto, Masaki ^b   Ito, Hiro ^a  

^a KYOTO UNIVERSITY   (Japan)

^b TOKAI UNIVERSITY   (Japan)

Author keywords

Constant time approximation algorithms; Maximum matching; Minimum set cover; Minimum vertex cover; Property testing

Indexed keywords

CONSTANT-TIME APPROXIMATION ALGORITHMS; MAXIMUM MATCHING; MINIMUM SET COVER; MINIMUM VERTEX COVER; PROPERTY TESTING;

COMPUTATION THEORY; IMAGE RETRIEVAL; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 70350701846     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536447     Document Type: Conference Paper

References (16)

1. J. Aronson, M. Dyer, A. Frieze, and S. Suen. Randomized greedy matching. II. Random Struct. Algorithms, 6(l):55-73, 1995.
2. A. S. Asratian, T. M. J. Denley, and R. Häggkvist. Bipartite graphs and their applications. Cambridge University Press, New York, NY, USA, 1998.
3. A. Czumaj and C. Sohler. Sublinear-time algorithms. Bulletin of the EATCS, 89:23-47, 2006.
4. M. Dyer and A. Frieze. Randomized greedy matching. Random Struct. Algorithms, 2(l):29-45, 1991.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.
6. O. Goldreich. Combinatorial property testing - a survey. In In: Randomization Methods in Algorithm Design, pages 45-60. American Mathematical Society, 1998.
7. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4):653-750, 1998.
8. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In STOC '97: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 406-415. ACM, 1997.
9. P. Indyk. Sublinear time algorithms for metric space problems. In STOC '99: Proceedings of the 31st annual ACM symposium on Theory of computing, pages 428-434, New York, NY, USA, 1999. ACM.
10. R. Kumar and R. Rubinfeld. Sublinear time algorithms. SIGACT News, 34:57-67, 2003.
11. L. Lovász. On the ratio of optimal integral and fractional covers. SIAM J. Discret. Math., 13:383-390, 1975.
12. S. Marko and D. Ron. Distance approximation in bounded-degree and general sparse graphs. APPROX-RANDOM, pages 475-486, 2006.
13. H. N. Nguyen and K. Onak. Constant-time approximation algorithms via local improvements. In FOCS '08: Proceedings of the the 49th Annual Symposium on Foundations of Computer Science, 2008.
14. M. Parnas and D. Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci., 381(1-3):183-196, 2007.
15. R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput., 25(2):252-271, 1996.
16. J. Suomela. Survey of local algorithms, manuscript, 2009.