Header menu link for other important links
Vertex Cover Problem—Revised Approximation Algorithm
Published in Springer India
Volume: 324
Pages: 9 - 16
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. © Springer India 2015.
About the journal
JournalData powered by TypesetAdvances in Intelligent Systems and Computing Artificial Intelligence and Evolutionary Algorithms in Engineering Systems
PublisherData powered by TypesetSpringer India
Open Access0