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.
CITATION STYLE
Shah, K., Reddy, P., & Selvakumar, R. (2015). Vertex cover problem—revised approximation algorithm. In Advances in Intelligent Systems and Computing (Vol. 324, pp. 9–16). Springer Verlag. https://doi.org/10.1007/978-81-322-2126-5_2
Mendeley helps you to discover research relevant for your work.