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

preprint2011arXivOpen access

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(ε)})$ time.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0