Abstract
The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2 - o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3/2, to find approximate vertex covers for a large collection of randomly generated graphs. 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 almost every single random graph we generate. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Asgeirsson, E., & Stein, C. (2007). Vertex cover approximations on random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 285–296). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
