An $n^{0.3+\epsilon }$-Approximation for Steiner $k$-Forest

Eden Chlamtáč

We give an $n^{0.3+\epsilon }$-approximation algorithm for the Steiner $k$-Forest problem, for any constant $\epsilon >0$. As a function of $n$, this improves over the $O(\min\…