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

David Eisenstat, Philip N. Klein, Claire Mathieu

Browse the full SODA paper archive.