A polynomial-time approximation scheme for Steiner tree in planar graphs

Authors:
Glencora Borradaile;Claire Kenyon-Mathieu;Philip Klein
Affiliations:
Brown University;Brown University;Brown University
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 13
Cited 25

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)
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)
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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

Optimal Surface Flattening

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation

Discrete Applied Mathematics
Homology flows, cohomology cuts

Proceedings of the forty-first annual ACM symposium on Theory of computing
An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)
Minimum cuts and shortest homologous cycles

Proceedings of the twenty-fifth annual symposium on Computational geometry
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A near linear time approximation scheme for Steiner tree among obstacles in the plane

Computational Geometry: Theory and Applications
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree

Proceedings of the forty-second ACM symposium on Theory of computing
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Contraction decomposition in h-minor-free graphs and algorithmic applications

Proceedings of the forty-third annual ACM symposium on Theory of computing
Dealing with large hidden constants: engineering a planar steiner tree PTAS

Journal of Experimental Algorithmics (JEA)
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
Global minimum cuts in surface embedded graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Minimum cuts and shortest non-separating cycles via homology covers

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Minimum weight 2-edge-connected spanning subgraphs in planar graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A near linear time approximation scheme for steiner tree among obstacles in the plane

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
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
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

Journal of Combinatorial Optimization
Counting and sampling minimum cuts in genus g graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(n log n) approximation scheme for Steiner tree in planar graphs.