Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems

scheme (FPTAS)
for the optimum fractional solution to the Steiner forest problem.
This can
easily be generalized to obtain an FPTAS for a hitting set problem
on a collection of clutters.
The algorithm is very simple to describe and has a running time
better than those of existing algorithms. For clutters that do not
satisfy the MFMC property (e.g., $k$-spanner, multicommodity flows,
$T$-cuts, $T$-joins etc.), this is the only algorithm known
(other than the generic algorithms for linear programming) for
solving such hitting set problems.