The Community for Technology Leaders
2015 13th International Conference on Frontiers of Information Technology (FIT) (2015)
Islamabad, Pakistan
Dec. 14, 2015 to Dec. 16, 2015
ISBN: 978-1-4673-9665-3
pp: 277-282
ABSTRACT
This paper presents a simple and fast polynomial time algorithm, the clever, steady strategy algorithm (CSSA). The proposed algorithm consists of three stages which produces optimal or approximate vertex cover for any unknown un-weighted and undirected G = (V, E). In the first step the degree of each node of the given graph is calculated. In second step the minimum degree node(s) is find and also the adjacent nodes of minimum degree nodes are find. In the third stage the minimum degree node in all adjacent nodes of minimum degree is searched out and is selected as a candidate for MVC and all its edges are deleted. These three steps are processed repeatedly until no edge remains in the graph. The CSSA is tested on small as well as on large benchmark instances. The experimental results and comparative analysis show that the CSSA yields better and fast solution than those approximation algorithms found in literature for solving minimum vertex cover problem.
INDEX TERMS
Approximation algorithms, Algorithm design and analysis, Benchmark testing, Optimization, Time complexity, Data structures, NP-complete problem,approximation algorithm, Minimum vertex cover (MVC), maximum independent set (MIS), NP-complete problem, optimization problem
CITATION
Muhammad Fayaz, Shakeel Arshad, "Clever Steady Strategy Algorithm: A Simple and Efficient Approximation Algorithm for Minimum Vertex Cover Problem", 2015 13th International Conference on Frontiers of Information Technology (FIT), vol. 00, no. , pp. 277-282, 2015, doi:10.1109/FIT.2015.55
88 ms
(Ver 3.3 (11022016))