Concepedia
Computational Geometry · 2008 · 44 citations · 25 references
Hamiltonian TheoryQuantum Lattice SystemPhysicsGrid HamiltonicityDiscrete MathematicsHamiltonian SystemCritical Phenomenon
25
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Sanjeev Arora · Journal of the ACM · 1998 · 1.1K citations · Full text
Engineering, Fixed Dimensions, Computational Complexity +20
The Planar Hamiltonian Circuit Problem is NP-Complete
M. R. Garey, D. S. Johnson, Robert E. Tarjan · SIAM Journal on Computing · 1976 · 520 citations
Mathematical Programming, Engineering, Planar Graph +17
Hamilton Paths in Grid Graphs
Alon Itai, Christos H. Papadimitriou, Jayme L. Szwarcfiter · SIAM Journal on Computing · 1982 · 507 citations
Mathematical Programming, Hamilton Paths, Directed Graph +17
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
Joseph S. B. Mitchell · SIAM Journal on Computing · 1999 · 447 citations
Mathematical Programming, Engineering, Geometry +26
The Traveling Salesman Problem with Distances One and Two
Christos H. Papadimitriou, Mihalis Yannakakis · Mathematics of Operations Research · 1993 · 412 citations
Mathematical Programming, Engineering, Computational Complexity +19