An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Data Structures and Algorithms
2011-10-26 v2
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.
Keywords
Cite
@article{arxiv.1110.1320,
title = {An efficient polynomial-time approximation scheme for Steiner forest in planar graphs},
author = {David Eisenstat and Philip Klein and Claire Mathieu},
journal= {arXiv preprint arXiv:1110.1320},
year = {2011}
}
Comments
added material on balanced branch decompositions; fixed theorem references