An Approximation of the Minimum Vertex Cover in a Graph

Japan Journal of Industrial and Applied Mathematics

Volumn 16, Issue 3, 1999, Pages 369-375

  Nagamochi, Hiroshi ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Cycle; Graph; Matching; Vertex cover

Indexed keywords

EID: 0347786278     PISSN: 09167005     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03167363     Document Type: Article

References (12)

1. B.S. Baker, Approximation algorithm for NP-complete problems on planar graphs. J. ACM, 41 (1994), 153-180.
2. R. Bar-Yehuda and S. Even, A local-ration theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25 (1985), 27-45.
3. P. Berman and M. Fürer, Approximating maximum independent set in bounded degree graphs. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, 365-371.
4. A.E.F. Clementi and L. Trevisan, Improved non-approximability results for vertex cover with density constraints. Lecture Notes in Computer Science, 1090, 2nd Conf. on Computing and Combinatorics, 1996, 333-342.
5. M.R. Garey and D.S. Johnson, Computers an Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
6. B. Monien and E. Speckenmeyer, Some further approximation algorithms for the vertex cover problem. Proc. CAAP '83, Lecture Notes in Computer Science, 159, Springer-Verlag, 1983, 341-349.
7. J. Håstad, Some optimal inapproximability results. Proc. 29th ACM Symp. on Theory of Computing, 1997, 1-10.
8. M.M. Halldórsson and J. Radhakrishnan, Improved approximations of independent sets in bounded-degree graphs. Lecture Notes in Computer Science, 824, 4th Scand. Workshop on Algorithm Theory, 1994, 195-206.
9. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput., 2 (1973), 225-231.
10. R.M. Karp, Reducibility among combinatorial problems. Complexity of Computer Computations (eds. R.E. Miller and J.W. Thatcher), Plenum Press, New York, 1972, 85-103.
11. M. Karpinski and A. Zelikovsky, Approximating dense cases of covering problems. Proc. DIMACS Workshop on Network Design: Connectivity and Facilities Location, 1997, 169-178.
12. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes. J. Comput. System Sci., 43 (1991), 425-440.