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

@inproceedings{Bateni2010ApproximationSF,
  title={Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth},
  author={MohammadHossein Bateni and Mohammad Taghi Hajiaghayi and D{\'a}niel Marx},
  booktitle={STOC},
  year={2010}
}
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. As a first step, we show how to build a Steiner forest spanner for such graphs. The crux of the process is a clustering procedure called prize-collecting clustering that breaks down the input instance into separate subinstances which are easier to handle; moreover, the terminals in different subinstances are far from each other. Each… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

74 Citations

01020'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…