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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Asgeirsson, E., & Stein, C. (2005). Vertex cover approximations: Experiments and observations. In Lecture Notes in Computer Science (Vol. 3503, pp. 545–557). Springer Verlag. https://doi.org/10.1007/11427186_47
Mendeley helps you to discover research relevant for your work.