An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Authors:
David Eisenstat;Philip Klein;Claire Mathieu
Affiliations:
Brown University;Brown University;Brown University
Venue:
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Year:
2012

Citing 14
Cited 1

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
A data structure for bicategories, with application to speeding up an approximation algorithm

Information Processing Letters
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
On the Approximability of the Steiner Tree Problem

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Dynamic Representation of Sparse Graphs

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A linear-time approximation scheme for planar weighted TSP

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms via contraction decomposition

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)
The Steiner Forest Problem revisited

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

Proceedings of the forty-second ACM symposium on Theory of computing

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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