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.

• Type: Conference
• Year: 2008
• Where: FOCS
• Authors: Glencora Borradaile, Philip N. Klein, Claire Mathieu
• Keywords: Euclidean Plane, FOCS 2008, N)-time Approximation Scheme, Steiner Forest Problem, Theoretical Computer Science