When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
暂无分享,去创建一个
[1] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[2] S. S. Sengupta,et al. The traveling salesman problem , 1961 .
[3] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[4] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[5] Marshall W. Bern,et al. The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..
[6] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[7] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[9] A. Ivanov,et al. Minimal Networks: The Steiner Problem and Its Generalizations , 1994 .
[10] Satish Rao,et al. Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.
[11] Pierluigi Crescenzi,et al. Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.
[12] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[13] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[14] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..
[15] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[16] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[17] Luca Trevisan,et al. Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..
[18] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[19] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[20] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[21] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[22] Marek Karpinski,et al. New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..
[23] Tao Jiang,et al. On the Complexity of Multiple Sequence Alignment , 1994, J. Comput. Biol..
[24] Luca Trevisan,et al. When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract) , 1997, STOC '97.
[25] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[26] Mihalis Yannakakis,et al. On the Complexity of Protein Folding , 1998, J. Comput. Biol..
[27] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[28] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[29] Todd Wareham,et al. A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment , 1995, J. Comput. Biol..
[30] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .
[31] H. Wareham. On the computational complexity of inferring evolutionary trees , 1992 .
[32] Sanjeev Arora. Probabilistic checking of proofs and hardness of approximation problems , 1995 .
[33] Lars Engebretsen,et al. An Explicit Lower Bound for TSP with Distances One and Two , 1999, Algorithmica.
[34] Christos H. Papadimitriou,et al. An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.