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

David Eisenstat, Philip Klein and Claire Mathieu

Abstract: We give an approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in time.

Guest: Claire Mathieu
Host: Zvi Lotker

Leave a Reply

Your email address will not be published.

165,457 Spam Comments Blocked so far by Spam Free Wordpress

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>