Euclidean Traveling Salesperson Problem

[1]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[2]  Jan Remy,et al.  A quasi-polynomial time approximation scheme for minimum weight triangulation , 2006, STOC '06.

[3]  Artur Czumaj,et al.  Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs , 2005, ESA.

[4]  Sanjeev Arora,et al.  Approximation schemes for NP-hard geometric optimization problems: a survey , 2003, Math. Program..

[5]  Luca Trevisan,et al.  When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree , 2000, SIAM J. Comput..

[6]  Sanjeev Arora,et al.  Approximation schemes for minimum latency problems , 1999, STOC '99.

[7]  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..

[8]  Andrzej Lingas,et al.  On approximability of the minimum-cost k-connected spanning subgraph problem , 1999, SODA '99.

[9]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[10]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[11]  Philip N. Klein,et al.  A polynomial-time approximation scheme for weighted planar graph TSP , 1998, SODA '98.

[12]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

[13]  D. Hochbaum.  Approximation Algorithms for NP-Hard Problems , 1996 .

[14]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[15]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[16]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.