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...
محفوظ في:
المؤلفون الرئيسيون: | Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah |
---|---|
التنسيق: | مقال |
اللغة: | English English |
منشور في: |
Science and Engineering Research Support Society (SERSC)
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | 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 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
بواسطة: Fayaz, Muhammad, وآخرون
منشور في: (2018) -
An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
بواسطة: Fayaz, Muhammad, وآخرون
منشور في: (2016) -
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
بواسطة: Fayaz, Muhammad, وآخرون
منشور في: (2016) -
An applications development for record keeping of police stations in Pakistan
بواسطة: Shah, Abdul Salam, وآخرون
منشور في: (2015) -
Risk management policies of telecommunication and engineering laboratories
بواسطة: Shah, Abdul Salam, وآخرون
منشور في: (2016)