An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
The minimum vertex cover problem (MVCP) is a well-known NP complete combinatorial optimization problem. The aim of this paper is to present an approximation algorithm for minimum vertex cover problem (MVCP). The algorithm construction is based on articulation points/cut vertices and leaf vertices/pendant vertices. The proposed algorithm assures the near optimal or optimal solution for a given graph and can be solved in polynomial time. A numerical example is illustrated to describe the proposed algorithm. Comparative results show that the proposed algorithm is very competitive compared with other existing algorithms.
- 1.Garry, M., Johnson, D.: Computers and Intractability: A User Guide to the Theory of NP Completeness. San Francisco (1979)Google Scholar
- 6.Listrovoy, S., Minukhin, S.: The solution algorithms for problems on the minimal vertex cover in networks and the minimal cover in Boolean matrixes. IJCSI. 9 (5), 8–15 (2012)Google Scholar
- 14.Shah, K., Reddy, P., Selvakumar, R.: Vertex Cover Problem - Revised Approximation Algorithm. In: Artificial Intelligence and Evolutionary Algorithms in Engineering Systems, pp. 9–16. Springer, New Delhi (2015)Google Scholar
- 18.Dahiya, S.: A New Approximation Algorithm for Vertex Cover Problem. In: International Conference on Machine Intelligence and Research Advancement, pp. 472–478, IEEE (2013)Google Scholar
- 20.Alom, B.M., Das, S., Rouf, M.A.: Performance evaluation of vertex cover and set cover problem using optimal algorithm. DUET Journal. 1 (2), (2011)Google Scholar