An efficient polynomial-time approximation scheme for Steiner forest in   planar graphs
  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. 
David Eisenstat and Philip Klein and Claire Mathieu
cs.DS