Sciweavers

Share
COCOON
2004
Springer

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

9 years 23 days ago
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.
Yong Zhang, Hong Zhu
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where COCOON
Authors Yong Zhang, Hong Zhu
Comments (0)
books