About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Information Processing Letters
Paper
A factor 2 approximation algorithm for the vertex cover P 3 problem
Abstract
We consider the vertex cover P n (VCP n) problem, that is, the problem of finding a minimum weight set F⊂V such that the graph G[V-F] has no P n, where P n is a path with n vertices. The problem also has its application background. In this paper, we restrict our attention to the VCP 3 problem and give a 2-approximation algorithm using the technique of layering. © 2011 Elsevier B.V.