Approximation algorithms for Steiner forest: An experimental study

Networks ◽  
2021 ◽  
Author(s):  
Laleh Ghalami ◽  
Daniel Grosu
Keyword(s):  
Experimental Study ◽  
Approximation Algorithms ◽  
Steiner Forest

scholarly journals Approximation algorithms for spanner problems and Directed Steiner Forest

2013 ◽  
Vol 222 ◽  
pp. 93-107 ◽  
Author(s):  
Piotr Berman ◽  
Arnab Bhattacharyya ◽  
Konstantin Makarychev ◽  
Sofya Raskhodnikova ◽  
Grigory Yaroslavtsev
Keyword(s):  
Approximation Algorithms ◽  
Steiner Forest

scholarly journals Improved approximation algorithms for Directed Steiner Forest

2012 ◽  
Vol 78 (1) ◽  
pp. 279-292 ◽  
Author(s):  
Moran Feldman ◽  
Guy Kortsarz ◽  
Zeev Nutov
Keyword(s):  
Approximation Algorithms ◽  
Steiner Forest

scholarly journals Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs

2013 ◽  
Vol 222 ◽  
pp. 293-306 ◽  
Author(s):  
Carsten Moldenhauer
Keyword(s):  
Approximation Algorithms ◽  
Planar Graphs ◽  
Steiner Forest ◽  
Primal Dual

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.

Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments

2010 ◽  
pp. 592-601 ◽  
Author(s):  
Valentin E. Brimkov ◽  
Andrew Leach ◽  
Michael Mastroianni ◽  
Jimmy Wu
Keyword(s):  
Experimental Study ◽  
Approximation Algorithms ◽  
Line Segments

scholarly journals An experimental study of approximation algorithms for the joint spectral radius

2012 ◽  
Vol 64 (1) ◽  
pp. 181-202 ◽  
Author(s):  
Chia-Tche Chang ◽  
Vincent D. Blondel
Keyword(s):  
Experimental Study ◽  
Approximation Algorithms ◽  
Spectral Radius ◽  
Joint Spectral Radius
Sign in / Sign up

Export Citation Format

Share Document