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 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.

• Type: Conference
• Year: 2005
• Where: WEA
• Authors: Eyjolfur Asgeirsson, Clifford Stein
• Keywords: Algorithms, Approximation Ratio, Vertex Cover, Vertex Cover Problem, WEA 2005