Vertex cover problem—revised approximation algorithm

Advances in Intelligent Systems and Computing

Volumn 324, Issue , 2015, Pages 9-16

  Shah, Kartik ^a   Reddy, Praveenkumar ^a   Selvakumar, R ^a  

^a VIT UNIVERSITY   (India)

Author keywords

Approximation algorithm; Articulation point; Optimization; Vertex covering problem

Indexed keywords

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION SOLUTION; ARTICULATION POINTS; DEPTH FIRST SEARCH ALGORITHMS; OPTIMUM SOLUTION; SIMPLE ALGORITHM; TIME ALGORITHMS; VERTEX COVER PROBLEMS; VERTEX-COVERING;

EVOLUTIONARY ALGORITHMS;

EID: 84914680341     PISSN: 21945357     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-81-322-2126-5_2     Document Type: Conference Paper

References (13)

1. M. Garry, D. Johnson, Computers and Intractability: A User Guide to the Theory of NP Completeness (San Francisco, 1979)
2. P.S. Oliveto, X. Yao, J. He, Analysis of Population-based Evolutionary Algorithms for the Vertex Cover Problem (IEEE, 2008), pp. 1563–1570
3. L. Ding, B. Gu, X. Hong, B. Dixon, Articulation node based routing in delay tolerant networks, in IEEE International Conference (2009), pp. 1–6
4. Y. Zeng, D. Wang, W. Liu, A. Xiong, An approximation algorithm for weak vertex cover problem in IP network traffic measurement, IEEE International Conference (2009), pp. 182–186
5. J. Chen, I.A. Kanj, G. Xia, Improved parameterized upper bounds for vertex cover. 31st International Conference on Mathematical Foundations of Computer Science (2006)
6. F. Delbot, C. Laforest, A better list heuristic for vertex cover. Inf. Process. Lett. 107, 125–127 (2008)
7. E. Angel, R. Campigotto, C. Laforest, Algorithm for the vertex cover problem on large graphs. IBISC Research report (2010)
8. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)
9. G.L. Nemhauser, L.E. Trotter, Vertex packing: structural properties and algorithms. Math. Program. 8, 232–248 (1975)
10. E. Asgeirsson, C. Stein, Vertex Cover Approximations on Random Graphs (Springer, Berlin, 2007), pp. 285–296
11. P. Erdos, A. Renyi, On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
12. F. Kuhn, M. Mastrolilli, Vertex cover in graphs with locally few colors (2011), pp 498–509
13. D. Hochbaum, Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555–556 (1982)