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

## David Eisenstat, Philip Klein and Claire Mathieu

Abstract: We give an $O(n log^3n)$ 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.

Guest: Claire Mathieu
Host: Zvi Lotker