An edge-reduction algorithm for the vertex cover problem

Authors:
Qiaoming Han;Abraham P. Punnen;Yinyu Ye
Affiliations:
School of Mathematics and Statistics, Zhejiang University of Finance and Economics, Hangzhou 310018, PR China;Department of Mathematics, Simon Fraser University, 14th Floor Central City Tower, 13450 102nd Ave., Surrey, BC V3T5X3, Canada;Department of Management Science and Engineering, School of Engineering, Stanford University, Stanford, CA 94305, USA
Venue:
Operations Research Letters
Year:
2009

Citing 10
Cited 2

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

Approximation algorithms for NP-hard problems
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover

SIAM Journal on Discrete Mathematics
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On semidefinite programming relaxations for graph coloring and vertex cover

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

SIAM Journal on Computing
Proving Integrality Gaps without Knowing the Linear Program

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Vertex cover approximations on random graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A better approximation ratio for the vertex cover problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Vertex cover approximations: experiments and observations

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

On the approximability of the vertex cover and related problems

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Strong and weak edges of a graph and linkages with the vertex cover problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approximation algorithm for the vertex cover problem is proposed with performance ratio 32 on special graphs. On an arbitrary graph, the algorithm guarantees a vertex cover S"1 such that |S"1|@?32|S^*|+@x where S^* is an optimal cover and @x is an error bound identified.