Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
2008
IEEE

favoriteEmaildiscussreport

97views Theoretical Computer Science» more FOCS 2008»

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

13 years 11 months ago

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

Download www.cs.brown.edu

We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every ﬁxed ǫ > 0 and given n terminals in the plane with connection requests between some pairs of terminals, our scheme ﬁnds a (1 + ǫ)-approximation to the minimum-length forest that connects every requested pair of terminals.

Glencora Borradaile, Philip N. Klein, Claire Mathi

Real-time Traffic

Euclidean Plane | FOCS 2008 | N)-time Approximation Scheme | Steiner Forest Problem | Theoretical Computer Science |

claim paper

Related Content

» Euclidean PrizeCollecting Steiner Forest

» Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

» A PolynomialTime Approximation Scheme for Weighted Planar Graph TSP

» Approximation Schemes for NodeWeighted Geometric Steiner Tree Problems

» PolynomialTime Approximation Schemes for SubsetConnectivity Problems in BoundedGenus Graph...

» Polynomial time approximation schemes for minimum disk cover problems

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» An Empirical Analysis of Approximation Algorithms for Euclidean TSP

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	FOCS
Authors	Glencora Borradaile, Philip N. Klein, Claire Mathieu

Comments (0)