An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Abstract

We give an $O(n{\log }^{3}n)$ approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in $O(n^{f(\epsilon )})$ time.

added material on balanced branch decompositions; fixed theorem references