A polynomial-time approximation scheme for euclidean steiner forest

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 115-124

  Borradaile, Glencora ^a   Klein, Philip N ^b   Mathieu, Claire ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Brown Univerity

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEMES; EUCLIDEAN; EUCLIDEAN PLANES; STEINER FOREST PROBLEMS; STEINER FORESTS;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; PORT TERMINALS;

POLYNOMIAL APPROXIMATION;

EID: 57949110002     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.59     Document Type: Conference Paper

References (12)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput., 24(3):440-456, 1995.
2. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. JACM, 45(5):753-782, 1998.
3. S. Arora. Approximation schemes for NP-hard geometric optimization problems: A survey. Math. Prog., 97:43-69, 2003.
4. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In 30th STOC, pages 106-113, 1998.
5. M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. IPL, 32:171-176, 1989.
6. R. Karp. On the computational complexity of combinatorial problems. Networks, 5:45-68, 1975.
7. S. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the Euclidean k-median problem. SIAM J. Comput., 37(3):757-782, 2007.
8. J. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput., 28(4): 1298-1309, 1999.
9. S. Rao and W. Smith. Approximating geometrical graphs via "spanners" and "banyans". In 30th STOC, pages 540-550, 1998.
10. M. Thimm. On the approximability of the Steiner tree problem. In 26th MFCS, volume 2136 of LNCS, pages 678-689, 2001.
11. L. Trevisan. When Hamming meets Euclid: the approximability of geometric TSP and MST. SIAM J. Comput., 30(2):475-485, 2001.
12. V. Vazirani. Approximation Algorithms, chapter Euclidean TSP, pages 84-89. Springer, 2001.