When hamming meets euclid: The approximability of geometric TSP and Steiner tree

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 475-485

  Trevisan, Luca ^a  

^a Columbia University ^*  (United States)

Author keywords

Combinatorial optimization; Computational complexity; Hardness of approximation; Steiner tree problem; Traveling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GEOMETRY; OPTIMIZATION; TREES (MATHEMATICS);

STEINER TREE PROBLEMS;

PROBLEM SOLVING;

EID: 0343773302     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799352735     Document Type: Article

References (40)

1. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
2. S. ARORA, Probabilistic Checking of Proofs and Hardness of Approximation Problems, Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, Berkeley, CA, 1994.
3. S. ARORA, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 2-11.
4. S. ARORA, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, J. ACM, 45 (1998), pp. 753-782.
5. S. ARORA, M. GRIGNI, D. KARGER, P. KLEIN, AND A. WOLOSZYN, Polynomial time approximation scheme for weighted planar graph TSP, in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, 1998, pp. 33-41.
6. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
7. M. BERN AND P. PLASSMANN, The Steiner tree problem with edge lengths 1 and 2, Inform. Process. Lett., 32 (1989), pp. 171-176.
8. D. BOVET AND P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1993.
9. N. CHRISTOFIDES, Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem, Tech. Rep., Carnegie-Mellon University, Pittsburgh, PA, 1976.
10. P. CRESCENZI, D. GOLDMAN, C. PAPADIMITRIOU, A. PICCOLBONI, AND M. YANNAKAKIS, On the complexity of protein folding, in Proceedings of the 30th ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1998, pp. 597-603.
11. P. CRESCENZI, V. KANN, R. SILVESTRI, AND L. TREVISAN, Structure in approximation classes, in Proceedings of the 1st Combinatorics and Computing Conference, Lecture Notes in Comput. Sci. 959, Springer-Verlag, New York, 1995, pp. 539-548.
12. W. DAY, D. JOHNSON, AND D. SANKOFF, The computational complexity of inferring rooted phylogenies by parsimony, Math. Biosci., 81 (1986), pp. 33-42.
13. L. ENGEBRESTEN, An Explicit Lower Bound for TSP with Distances One and Two, Tech. Rep. TR98-046, Electronic Colloquium on Computational Complexity, 1998.
14. J. GANLEY, The Steiner Tree Page, http://www.cs.virginia.edu/∼jlg8k/steiner.
15. M. GAREY, R. GRAHAM, AND D. JOHNSON, Some NP-complete geometric problems, in Proceedings of the 8th ACM Symposium on Theory of Computing, Hershey, PA, ACM, New York, 1976, pp. 10-22.
16. M. GAREY, R. GRAHAM, AND D. JOHNSON, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math., 32 (1977), pp. 835-859.
17. M. GAREY AND D. JOHNSON, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math., 32 (1977), pp. 826-834.
18. M. GRIGNI, E. KOUTSOUPIAS, AND C. PAPADIMITRIOU, An approximation scheme for planar graph TSP, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE, Piscataway, NJ, 1995, pp. 640-645.
19. I. HOLYER, The NP-completeness of edge-coloring, SIAM J. Comput., 10 (1981), pp. 718-720.
20. F. HWANG, D. RICHARDS, AND P. WINTER, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
21. P. INDYK AND R. MOTWANI, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1998, pp. 604-613.
22. A. IVANOV AND A. TUZHILIN, Minimal Networks: The Steiner Problem and Its Generalizations, CRC Press, Boca Raton, FL, 1994.
23. T. JIANG AND L. WANG, On the complexity of multiple sequence alignment, J. Comput. Biol., 1 (1994), pp. 337-348.
24. M. KARPINSKI AND A. ZELIKOVSKY, New approximation algorithms for the Steiner tree problems, J. Comb. Optim., 1 (1997), pp. 1-19.
25. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability, SIAM J. Comput., 28 (1999), pp. 164-191.
26. J. M. KLEINBERG, Two algorithms for nearest-neighbor search in high dimensions, in Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, ACM, New York, 1997, pp. 599-608.
27. E. KUSHILEVITZ, R. OSTROVSKY, AND Y. RABANI, Efficient search for approximate nearest neighbor in high dimensional spaces, in Proceedings of the 30th ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1998, pp. 614-623.
28. E. LAWLER, J. LENSTRA, A. R. KAN, AND D. SHMOYS, The Traveling Salesman Problem, John Wiley, New York, 1985.
29. J. S. B. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems, SIAM J. Comput., 28 (1999), pp. 1298-1309.
30. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, in Proceedings of the 22nd ACM Symposium on Theory of Computing, St. Louis, MO, IEEE, Piscataway, NJ, 1990, pp. 213-223.
31. C. PAPADIMITRIOU, Euclidean TSP is NP-complete, Theoret. Comput. Sci., 4 (1977), pp. 237-244.
32. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
33. C. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
34. C. PAPADIMITRIOU AND M. YANNAKAKIS, The travelling salesman problem with distances one and two, Math. Oper. Res., 18 (1993), pp. 1-11.
35. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
36. S. RAO AND W. SMITH, Approximating geometrical graphs via "spanners" and "banyans," in Proceedings of the 30th ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1998, pp. 540-550.
37. L. TREVISAN, When Hamming meets Euclid: The approximability of geometric TSP and MST, in Proceedings of the 29th ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1997, pp. 21-29.
38. J. VAN LINT AND R. WILSON, A Course in Combinatorics, Cambridge University Press, Cambridge, UK, 1992.
39. H. WAREHAM, On the Computational Complexity of Inferring Evolutionary Trees, Master's thesis, Department of Computer Science, Memorial University of Newfoundland, Canada, 1993. Also available online from http://www.csr.uvic.ca/∼harold/.
40. H. WAREHAM, A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment, J. Comput. Biol., 2 (1995), pp. 509-514.