Approximation algorithm for weighted weak vertex cover

Journal of Computer Science and Technology

Volumn 19, Issue 6, 2004, Pages 782-786

  Zhang, Yong ^a   Zhu, Hong ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

Approximation algorithm; NP hard; Weak vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; INTERNET; ITERATIVE METHODS; MONITORING; ROUTERS; SET THEORY; THEOREM PROVING; THROUGHPUT;

APPROXIMATION ALGORITHM; NETWORK FLOW; NP-HARD; WEAK VERTEX COVER;

DATA FLOW ANALYSIS;

EID: 12744279692     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02973439     Document Type: Article

References (7)

1. Jamin S, Jin C, Jin Y, Raz D, Shavitt Y, Zhang L. On the placement of Internet instrumentation. In Proceedings of the IEEE INFOCOM 2000, 2000, pp.26-30.
2. Lai K, Baker M. Measuring bandwidth. In Proceedings of the IEEE INFOCOM'99, New York, 1999, pp.235-245.
3. Liu Xianghui et al. Analysis of efficient monitoring method for the network flow. Journal of Software, 2003, 14(2): 300-304.
4. Dorit S Hochbaum. Approximation Algorithm for NP-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.