Title :
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
Author :
Borradaile, Glencora ; Klein, Philip N. ; Mathieu, Claire
Author_Institution :
Combinatorics & Optimization, Univ. of Waterloo, Waterloo, ON
Abstract :
We give a randomized O(n2 log n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed epsi > 0 and given any n pairs of terminals in the plane, our scheme finds a (1 + epsi)- approximation to the minimum-length forest that connects every pair of terminals.
Keywords :
computational complexity; polynomial approximation; Euclidean Steiner forest; minimum-length forest; polynomial-time approximation scheme; Approximation algorithms; Combinatorial mathematics; Computer science; Costs; Dynamic programming; Polynomials; Portals; Steiner trees; Euclidean plane; Steiner forest; approximation algorithm; approximation scheme;
Conference_Titel :
Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
Conference_Location :
Philadelphia, PA
Print_ISBN :
978-0-7695-3436-7
DOI :
10.1109/FOCS.2008.59
