On approximating minimum vertex cover for graphs with perfect matching

Theoretical Computer Science

Volumn 337, Issue 1-3, 2005, Pages 305-318

  Chen, Jianer ^a,b   Kanj, Iyad A ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b CENTRAL SOUTH UNIVERSITY   (China)

^c DEPAUL UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Graph matching; Inapproximability; Vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; GRAPH MATCHING; INAPPROXIMABILITY; VERTEX COVER;

COMPUTER SCIENCE;

EID: 18444370571     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.034     Document Type: Article

References (16)

1. R. Bar-Yehuda, and S. Even A local-ratio theorem for approximating the weighted vertex cover problem Ann. Discrete Math. 25 1985 27 46
2. P. Berman, and T. Fujito On approximation properties of the independent set problem for low degree graphs Theory Comput. Systems 32 1999 115 132
3. M. Chlebík, J. Chlebíková, On approximation hardness of the minimum 2SAT- DELETION problem, Proc. 29th Int. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 3153, 2004, pp. 263-273.
4. A. Clementi, and L. Trevisan Improved non-approximability results for minimum vertex cover with density constraints Theoret. Comput. Sci. 225 1999 113 128
5. I. Dinur, S. Safra, The importance of being biased, Proc. 34th Annu. ACM Symp. on Theory of Computing, 2002, pp. 33-42.
6. U. Feige, M. Goemans, Approximating the value of two prover proof system, with applications to MAX-2SAT and MAX-DCUT, Proc. Third Israel Symp. on Theory of Computing and Systems, 1995, pp. 182-189.
7. M. Garey, and D. Johnson Computers and Intractability A Guide to the Theory of NP-completeness 1979 Freeman San Francisco
8. M. Halldórsson, Approximating discrete collections via local improvements, Proc. Sixth Annu. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 160-169.
9. M. Halldórsson, and J. Radhakrishnan Greed is good approximating independent sets in sparse and bounded-degree graphs Algorithmica 18 1997 145 163
10. J. Håstad, Some optimal inapproximability results, Proc. 29th Annu. ACM Symp. on Theory of Computing, (1997), 1-10.
11. D. Hochbaum Efficient bounds for the stable set vertex cover and set packing problems, Discrete Appl. Math. 6 1983 243 254
12. D. Hochbaum Approximating covering and packing problems set cover, vertex cover, independent set, and related problems D. Hochbaum Approximation Algorithms for NP-hard Problems 1997 PWS Publishing Company Boston 94 143
13. H. Karloff, U. Zwick, A 7/8-approximation algorithm for MAX-3SAT? Proc. 30th IEEE Symp. on the Foundation of Computer Science, 1997, pp. 406-415.
14. S. Micali, V. Vazirani, An O (√|V|·|E|) algorithm for finding maximum matching in general graphs, Proc. 21st IEEE Symp. on the Foundation of Computer Science, 1980, pp. 17-27.
15. B. Monien, and E. Speckenmeyer Ramsey numbers and an approximation algorithm for the vertex cover problem Acta Inform. 22 1985 115 123
16. G.L. Nemhauser, and L.E. Trotter Vertex packing structural properties and algorithms Math. Program. 8 1975 232 248