We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus.

Nov 26, 2009 · We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus.

We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded ...

ABSTRACT. We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally,.

It is shown that Steiner forest can be solved in polynomial time for series-parallel graphs (graphs of treewidth at most two) by a novel combination of ...

Nov 26, 2009 · Abstract. We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest prob- lem on planar graphs and, ...

Graphs of bounded treewidth and branchwidth are tree-like, and many problems can be solved exactly in linear time on such graphs. As we will see, this is not ...

We give an O(n log3 n) approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, ...

In particular, they showed that Steiner Forest admits an approximation scheme for graphs of treewidth k, which computes a (1 + ε)-approximation in nO(k2/ε) time.

We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in time, where tw is the graphʼs treewidth.