Experimental Comparison of Five Approximation Algorithms for Minimum Vertex Cover

2014 ◽  
Vol 7 (6) ◽  
pp. 69-84 ◽  
Author(s):  
Imran Khan ◽  
Sangeen Khan
Keyword(s):  
Approximation Algorithms ◽  
Vertex Cover ◽  
Experimental Comparison

scholarly journals The effectiveness of population-based Pareto-approximation algorithms. Experimental comparison

2016 ◽  
Vol 8 (4) ◽  
Author(s):  
Sergey Groshev ◽  
Anatoly Karpenko ◽  
Vladimir Martynyuk
Keyword(s):  
Approximation Algorithms ◽  
Population Based ◽  
Experimental Comparison

scholarly journals Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

2018 ◽  
Vol 27 ◽  
pp. 26-56
Author(s):  
Édouard Bonnet ◽  
Bruno Escoffier ◽  
Vangelis Th. Paschos ◽  
Georgios Stamoulis
Keyword(s):  
Approximation Algorithms ◽  
Vertex Cover ◽  
Bipartite Graphs

scholarly journals Practical comparison of approximation algorithms for scheduling problems

2004 ◽  
Vol 24 (2) ◽  
pp. 227-252
Author(s):  
Eduardo Candido Xavier ◽  
Flávio K. Miyazawa
Keyword(s):  
Experimental Study ◽  
Approximation Algorithms ◽  
Completion Time ◽  
Parallel Machines ◽  
Linear Formulation ◽  
The Other ◽  
Experimental Comparison ◽  
Scheduling Problems ◽  
Weighted Completion Time ◽  
Almost All

In this paper we consider an experimental study of approximation algorithms for scheduling problems in parallel machines minimizing the average weighted completion time. We implemented approximation algorithms for the following problems: P|r j|sigmaCj, P||sigmaw jCj, P|r j|sigmaw jCj, R||sigmaw jCj and R|r j|sigmaw jCj. We generated more than 1000 tests over more than 200 different instances and present some practical aspects of the implemented algorithms. We also made an experimental comparison on two lower bounds based on the formulations used by the algorithms. The first one is a semidefinite formulation for the problem R||sigmaw jCj and the other one is a linear formulation for the problem R|r j|sigmaw jCj. For all tests, the algorithms obtained very good results. We notice that algorithms using more refined techniques, when compared to algorithms with simple strategies, do not necessary lead to better results. We also present two heuristics, based on approximation algorithms, that generate solutions with better quality in almost all instances considered.

Sign in / Sign up

Export Citation Format

Share Document