Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
We introduce 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 first show that the VCP n problem is NP-hard for any integer n≥2. Then we restrict our attention to the VC P3 problem and give a 2-approximation algorithm using the primal-dual method. © 2011 Elsevier B.V. All rights reserved.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
David A. Selby
IBM J. Res. Dev
Preeti Malakar, Thomas George, et al.
SC 2012