A Simple, Fast and Near Optimal Approximation Algorithm for Optimization of Un-Weighted Minimum Vertex Cover
2016 International Conference on Frontiers of Information Technology (FIT) (2016)
Dec. 19, 2016 to Dec. 21, 2016
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FIT.2016.040
This paper presents a simple and efficient near optimal algorithm, named Maximum Adjacent Minimum degree Algorithm (MAMA) for optimization of minimum vertex cover problem. The proposed algorithm at each step add that maximum degree vertex which is adjacent to minimum degree vertex. The computational complexity and optimality comparison are carried with other state of the art algorithms on small benchmark instances as well as on large benchmark instances to check the efficiency of the proposed algorithm. The proposed algorithm outperforms the other well-known algorithm and returns near optimal result in quick time.
Approximation algorithms, Algorithm design and analysis, Benchmark testing, NP-complete problem, Optimization, Time complexity,optimal, minimum vertex cover problem, maximum independent set problem, NP-problem, approximation algorithm
Muhammad Fayaz, Shakeel Arshad, Umar Zaman, Akhlaque Ahmad, "A Simple, Fast and Near Optimal Approximation Algorithm for Optimization of Un-Weighted Minimum Vertex Cover", 2016 International Conference on Frontiers of Information Technology (FIT), vol. 00, no. , pp. 176-180, 2016, doi:10.1109/FIT.2016.040