Abstract
This paper is aimed to present the solution to vertex cover problem by means of an approximation solution. As it is NP complete problem, we can have an approximate time algorithm to solve the vertex cover problem. We will modify the algorithm to have an algorithm which can be solved in polynomial time and which will give near to optimum solution. It is a simple algorithm which will be based on articulation point. Articulation point can be found using the Depth First Search algorithm.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
M. Garry, D. Johnson, Computers and Intractability: A User Guide to the Theory of NP Completeness (San Francisco, 1979)
P.S. Oliveto, X. Yao, J. He, Analysis of Population-based Evolutionary Algorithms for the Vertex Cover Problem (IEEE, 2008), pp. 1563–1570
L. Ding, B. Gu, X. Hong, B. Dixon, Articulation node based routing in delay tolerant networks, in IEEE International Conference (2009), pp. 1–6
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
J. Chen, I.A. Kanj, G. Xia, Improved parameterized upper bounds for vertex cover. 31st International Conference on Mathematical Foundations of Computer Science (2006)
F. Delbot, C. Laforest, A better list heuristic for vertex cover. Inf. Process. Lett. 107, 125–127 (2008)
E. Angel, R. Campigotto, C. Laforest, Algorithm for the vertex cover problem on large graphs. IBISC Research report (2010)
R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)
G.L. Nemhauser, L.E. Trotter, Vertex packing: structural properties and algorithms. Math. Program. 8, 232–248 (1975)
E. Asgeirsson, C. Stein, Vertex Cover Approximations on Random Graphs (Springer, Berlin, 2007), pp. 285–296
P. Erdos, A. Renyi, On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
F. Kuhn, M. Mastrolilli, Vertex cover in graphs with locally few colors (2011), pp 498–509
D. Hochbaum, Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555–556 (1982)
Acknowledgment
We would like to thank the School of Computer Science and Engineering, VIT University, for giving us such an opportunity to carry out this research work and also for providing us the requisite resources and infrastructure for carrying out the research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Shah, K., Reddy, P., Selvakumar, R. (2015). Vertex Cover Problem—Revised Approximation Algorithm. In: Suresh, L., Dash, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Advances in Intelligent Systems and Computing, vol 324. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2126-5_2
Download citation
DOI: https://doi.org/10.1007/978-81-322-2126-5_2
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2125-8
Online ISBN: 978-81-322-2126-5
eBook Packages: EngineeringEngineering (R0)