Journal of Computer Science and Technology

, Volume 19, Issue 6, pp 782–786 | Cite as

Approximation algorithm for weighted weak vertex cover

  • Yong Zhang
  • Hong Zhu
Algorithms and Computational Complexity


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 graphG=(V,E). In this paper, we give an approximation algorithm to solve it, which has the approximation ratio lnd+1, whered is the maximum degree of the vertex in graphG, and improve the previous work.


weak vertex cover NP-hard approximation algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Jamin S, Jin C, Jin Y, Raz D, Shavitt Y, Zhang L. On the placement of Internet instrumentation. InProceedings of the IEEE INFOCOM 2000, 2000, pp.26–30.Google Scholar
  2. [2]
    Lai K, Baker M. Measuring bandwidth. InProceedings of the IEEE INFOCOM'99, New York, 1999, pp.235–245.Google Scholar
  3. [3]
    Liu Xianghuiet al. Analysis of efficient monitoring method for the network flow.Journal of Software 2003, 14(2): 300–304.MathSciNetGoogle Scholar
  4. [4]
    Dorit S Hochbaum. Approximation Algorithm forNP-Hard Problems. PWS Publishing Company, 1997.Google Scholar
  5. [5]
    Vijay V Vazitani. Approximation Algorithms. Springer-Verlag, 2001.Google Scholar
  6. [6]
    Corman T H, Leiserson C E, Rivest R L, Stein C. Introduction to Algorithms. Second Edition, The MIT Press, 2001.Google Scholar
  7. [7]
    Michel Gondran, Michel Minoux. Graph and Algorithms. John Wiley & Sons, March 1984.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2004

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringFudan UniversityShanghaiP.R. China
  2. 2.Laboratory for Intelligent Information ProcessingFudan UniversityShanghaiP.R. China

Personalised recommendations