An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
classification
💻 cs.DS
keywords
approximationschemeforestgraphsplanarsteinerefficientepsilon
read the original abstract
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(\epsilon)})$ time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.