Skip to main content
SpringerLink
Log in

Approximation algorithm for weighted weak vertex cover

  • Algorithms and Computational Complexity
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  2. Lai K, Baker M. Measuring bandwidth. InProceedings of the IEEE INFOCOM'99, New York, 1999, pp.235–245.

  3. Liu Xianghuiet al. Analysis of efficient monitoring method for the network flow.Journal of Software 2003, 14(2): 300–304.

    MathSciNet  Google Scholar 

  4. Dorit S Hochbaum. Approximation Algorithm forNP-Hard Problems. PWS Publishing Company, 1997.

  5. Vijay V Vazitani. Approximation Algorithms. Springer-Verlag, 2001.

  6. Corman T H, Leiserson C E, Rivest R L, Stein C. Introduction to Algorithms. Second Edition, The MIT Press, 2001.

  7. Michel Gondran, Michel Minoux. Graph and Algorithms. John Wiley & Sons, March 1984.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Fudan University, 200433, Shanghai, P.R. China

    Yong Zhang & Hong Zhu

  2. Laboratory for Intelligent Information Processing, Fudan University, 200433, Shanghai, P.R. China

    Yong Zhang & Hong Zhu

Authors
  1. Yong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Zhu.

Additional information

Note

This work is supported by the Ministry of Science and Technology of China (Grant No.2001CCA03000), the National Natural Science Foundation of China (Grant No.60273045), and the Shanghai Science and Technology Development Foundation (Grant No.025115032).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Y., Zhu, H. Approximation algorithm for weighted weak vertex cover. J. Comput. Sci. & Technol. 19, 782–786 (2004). https://doi.org/10.1007/BF02973439

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02973439

Keywords

Search

Navigation