Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
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.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
David A. Selby
IBM J. Res. Dev