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...
Saved in:
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: | |
Online Access: | 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 http://irep.iium.edu.my/62522/ http://www.sersc.org/journals/IJCA/vol11_no2.php |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2018) -
An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2016) -
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
by: Fayaz, Muhammad, et al.
Published: (2016) -
An applications development for record keeping of police stations in Pakistan
by: Shah, Abdul Salam, et al.
Published: (2015) -
Risk management policies of telecommunication and engineering laboratories
by: Shah, Abdul Salam, et al.
Published: (2016)