An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight function w. In this paper, we show that a weak vertex cover set approximating a minimum one within 2 − 2 ν(G) can be efficiently found in undirected graphs, and improve the previous work of approximation ratio within ln d + 1, where d is the maximum degree of the vertex in graph G.

• Type: Conference
• Year: 2004
• Where: COCOON
• Authors: Yong Zhang, Hong Zhu
• Keywords: COCOON 2004, Weak Vertex Cover, Weight Function W, Weighted Weak Vertex