Vertex Cover Approximations: Experiments and Observations

The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, each of which guarantees an approximation ratio of $\frac{3}{2}$, to find approximate vertex covers for a large collection of test graphs from various sources. We explain these reductions and explore the interaction between them. These reductions are extremely fast and even though they, by themselves are not guaranteed to find a vertex cover, we manage to find a 3/2-approximate vertex cover for every single graph in our large collection of test examples.

[1]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[2]  Michael R. Fellows,et al.  An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[3]  Laura A. Sanchis,et al.  Test Case Construction for the Vertex Cover Problem , 1992, Computational Support for Discrete Mathematics.

[4]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[5]  Magnús M. Halldórsson,et al.  Approximating discrete collections via local improvements , 1995, SODA '95.

[6]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[7]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[8]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[9]  Andrew V. Goldberg,et al.  Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms , 1998, JEAL.

[10]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[11]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[12]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[13]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[14]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[15]  Rolf Niedermeier,et al.  On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[18]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..