Approximating the minimum weight weak vertex cover

Authors:
Yong Zhang;Qi Ge;Rudolf Fleischer;Tao Jiang;Hong Zhu
Affiliations:
Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China;Shanghai Globalization Laboratory, IBM, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China
Venue:
Theoretical Computer Science - Computing and combinatorics
Year:
2006

Citing 6
Cited 1

Graphs and algorithms

Graphs and algorithms
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Algorithms

Introduction to Algorithms
Domination in Graphs Applied to Electric Power Networks

SIAM Journal on Discrete Mathematics
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Approximation algorithm for weighted weak vertex cover

Journal of Computer Science and Technology

Analytical and experimental comparison of six algorithms for the vertex cover problem

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Accurate network flow measurement is important for a variety of network applications, where the "flow" over an edge in the network is intuitively the rate of data traffic. The problem of efficiently monitoring the network flow can be regarded as finding the minimum weight weak vertex cover for a given graph. In this paper, we present a (2 - 2/v(G)-approximation algorithm solving for this problem, which improves previous results, where v(G) is the cyclomatic number of G.