On approximating minimum vertex cover for graphs with perfect matching

Authors:
Jianer Chen;Iyad A. Kanj
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX and College of Information Science and Engineering, Central-South University, ChangSha, Hunan 410083, P.R. China;School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL
Venue:
Theoretical Computer Science
Year:
2005

Citing 9
Cited 4

Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica
Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

Approximation algorithms for NP-hard problems
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved non-approximability results for minimum vertex cover with density constraints

Theoretical Computer Science
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

A better approximation ratio for the vertex cover problem

ACM Transactions on Algorithms (TALG)
Backdoor trees

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The complexity of finding subgraphs whose matching number equals the vertex cover number

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	5.23

Visualization

Abstract

It has been a challenging open problem whether there is a polynomial time approximation algorithm for the VERTEX COVER problem whose approximation ratio is bounded by a constant less than 2. In this paper, we study the VERTEX COVER problem on graphs with perfect matching (shortly, VC-PM). We show that if the VC-PM problem has a polynomial time approximation algorithm with approximation ratio bounded by a constant less than 2, then so does the VERTEX COVER problem on general graphs. Approximation algorithms for VC-PM are developed, which induce improvements over previously known algorithms on sparse graphs. For example, for graphs of average degree 5, the approximation ratio of our algorithm is 1.414, compared with the previously best ratio 1.615 by Halldórsson and Radhakrishnan.