Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review

Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review

In this paper, a detailed literature review and comparative analysis, based on simplicity, efficiency and the run-time complexity of some well known approximation algorithms for Minimum Vertex Cover (MVC) problem have been carried out. The key contribution of this paper is the provision of small ben...

Full description

Bibliographic Details
Main Authors: Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah
Format: Article
Language:English
English
Published: Science and Engineering Research Support Society (SERSC) 2018
Subjects:
T10.5 Communication of technical information
Online Access:http://irep.iium.edu.my/62522/
http://irep.iium.edu.my/62522/7/62522%20Approximate%20methods%20for%20minimum%20vertex%20cover%20fail%20to%20provide%20optimal%20results%20SCOPUS.pdf
http://irep.iium.edu.my/62522/13/62522_Approximate%20methods%20for%20minimum%20vertex%20cover%20fail%20to%20provide%20optimal%20results%20on%20small%20graph%20instances.pdf

Similar Items

Similar Items