Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth


We give the first <i>polynomial-time approximation scheme</i> (PTAS) for the <i>Steiner forest</i> problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we show how to build a <i>Steiner forest spanner</i> for such graphs. The crux of the process is a clustering procedure called <i>prize-collecting clustering</i> that… (More)
DOI: 10.1145/2027216.2027219


6 Figures and Tables


Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.