Sciweavers

Share
FOCS
2008
IEEE

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

11 years 21 days ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane with connection requests between some pairs of terminals, our scheme finds a (1 + ǫ)-approximation to the minimum-length forest that connects every requested pair of terminals.
Glencora Borradaile, Philip N. Klein, Claire Mathi
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where FOCS
Authors Glencora Borradaile, Philip N. Klein, Claire Mathieu
Comments (0)
books