Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
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.
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
M.F. Cowlishaw
IBM Systems Journal
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Limin Hu
IEEE/ACM Transactions on Networking