We consider the currently strongest Steiner tree approximation algorithm that has recently been published by Goemans, Olver, Rothvoß and Zenklusen (2012). It first solves a hypergraphic LP relaxation and then applies matroid theory to obtain an integral solution. The cost of the resulting Steiner tree is at most
$$(1.39 + \varepsilon )$$
-times the cost of an optimal Steiner tree where
tends to zero as some parameter
tends to infinity. However, the degree of the polynomial running time depends on this constant
, so only small
are tractable in practice.
The algorithm has, to our knowledge, not been implemented and evaluated in practice before. We investigate different implementation aspects and parameter choices of the algorithm and compare tuned variants to an exact LP-based algorithm as well as to fast and simple