An O(n log n) approximation scheme for Steiner tree in planar graphs

Authors:
Glencora Borradaile;Philip Klein;Claire Mathieu
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 26
Cited 13

A faster approximation algorithm for the Steiner problem in graphs

Acta Informatica
On approximation algorithms for Steiner's problem in graphs

International Workshop WG '86 on Graph-theoretic concepts in computer science
Send-and-split method for minimum-concave-cost network flows

Mathematics of Operations Research
A faster approximation algorithm for the Steiner problem in graphs

Information Processing Letters
Convexity and the Steiner tree problem

Networks
An approximation scheme for finding Steiner trees with obstacles

SIAM Journal on Computing
The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Improved approximations for the Steiner tree problem

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Approximating geometrical graphs via “spanners” and “banyans”

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
A 1.598 approximation algorithm for the Steiner problem in graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
RNC-Approximation Algorithms for the Steiner Problem

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Better approximation bounds for the network and Euclidean Steiner tree problems

Better approximation bounds for the network and Euclidean Steiner tree problems
Multiple-source shortest paths in planar graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
A linear-time approximation scheme for planar weighted TSP

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A subset spanner for Planar graphs,: with application to subset TSP

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A polynomial-time approximation scheme for Steiner tree in planar graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Steiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilon

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Approximation algorithms for NP-hard optimization problems

Algorithms and theory of computation handbook
Connecting face hitting sets in planar graphs

Information Processing Letters
Dealing with large hidden constants: engineering a planar steiner tree PTAS

Journal of Experimental Algorithmics (JEA)
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Journal of the ACM (JACM)
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A polynomial-time approximation scheme for planar multiway cut

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs

Theoretical Computer Science
Improved steiner tree algorithms for bounded treewidth

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Improved Steiner tree algorithms for bounded treewidth

Journal of Discrete Algorithms
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs

Information and Computation
Steiner Tree Approximation via Iterative Randomized Rounding

Journal of the ACM (JACM)
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a Polynomial-Time Approximation Scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).