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
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
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)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
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 polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
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
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
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
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Flattening topologically spherical surface
Journal of Combinatorial Optimization
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
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We give an algorithm that, for any ε 0, any undirected planar graph G, and any set S of nodes of G, computes a (1+ε)-optimal Steiner tree in G that spans the nodes of S. The algorithm takes time O(2poly(1/ε)n log n).