An approximation algorithm for weighted weak vertex cover problem in undirected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 143-150

  Zhang, Yong ^a   Zhu, Hong ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DATA FLOW ANALYSIS; FLOW GRAPHS;

APPROXIMATION RATIOS; GRAPH G; MAXIMUM DEGREE; NETWORK FLOWS; UNDIRECTED GRAPH; WEAK VERTEX COVER; WEIGHT FUNCTIONS;

GRAPH THEORY;

EID: 35048862464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_17     Document Type: Article

References (12)

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. Tel-Aviv, Israel. 2000.26-30
2. Lai K, Baker M, Measuring bandwidth. In Proceedings of the IEEE INFOCOM'99.New York, 1999.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. Zhang Yong and Zhu Hong, An Approximation Algorithm for Weighted Weak Vertex Cover. Journal of Computer Science and Technology, accepted.
5. Breibart Y, Chan CY, Carofalakis M, Rastogi R, Silberschatz A, Efficiently monitoring bandwidth and latency in IP network. In Proceedings of the IEEE INFOCOM 2001.Alaska, USA. 2001.933-942.
6. Dorit S. Hochbaum, Approximation Algorithm for script NP-Hard Problems, PWS Publishing Company, 1997.
7. Vijay V. Vazirani, Approximation Algorithms. Springer-Verlag, 2001.
8. T H. Corman, C E. Leiserson, R L. Rivest, C Stein, Introduction to Algorithms,Second Edition, The MIT Press, 2001.
9. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math., 25:27-45, 1985.
10. Vineet Bafna, Piotr Berman, Toshihiro Fujito, Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. ISAAC 1995: 142-151
11. M.R. Garey and D.S. Johnson, Conputers and intractablity: A Guide to the Theory of NP-Completeness. W.H.Freeman, 1979.
12. Michel Gondran and Michel Minoux, Graph and Algorithms, John Wiley & Sons Publication, March 1984.