Vertex cover using approximation approach
Swati Jain, Ashish Kumar Sharma · International Journal of Advances in Computing and Information Technology · 2012
Vertex cover is one of the best known NP-Hard optimization problem, that plays central role in computer science and it has real world application in the areas of circuit design, computational biochemistry, telecommunications, and network flow. This paper presents a new heuristic solution for vertex cover problem. This technique is computationally efficient with complexity O ( E ). In this paper performance of alom’s algorithm compared with our proposed algorithm using output solution.