Approximation algorithm for weighted weak vertex cover

Authors:
Yong Zhang;Hong Zhu
Affiliations:
Department of Computer Science and Engineering, Fudan University, Shanghai 200433, P.R. China;Laboratory for Intelligent Information Processing, Fudan University, Shanghai 200433, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 4
Cited 3

Graphs and algorithms

Graphs and algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Approximation algorithms

Approximation algorithms
Introduction to Algorithms

Introduction to Algorithms

Approximating the minimum weight weak vertex cover

Theoretical Computer Science - Computing and combinatorics
Efficiently passive monitoring flow bandwidth

NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
An approximation algorithm for weak vertex cover problem in network management

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of efficiently monitoring the network flow is regarded as the problem to find out the minimum weighted weak vertex cover set for a given graph G = (V, E). In this paper, we give an approximation algorithm to solve it, which has the approximation ratio In d + 1, where d is the maximum degree of the vertex in graph G, and improve the previous work.