Performance guarantees for the TSP with a parameterized triangle inequality

<title>QBIC project: querying images by content, using color, texture, and shape</title>

Carlton W. Niblack, Ron Barber, W. Equitz et al. · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1993 · 1.8K citations

Computing, Computer Science, Information Systems +17

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

Sanjeev Arora · 2002 · 452 citations

Computing, Computer Science, Mathematics +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 · 451 citations

Computing, Computer Science, Mathematics +17

The Traveling Salesman Problem with Distances One and Two

Christos H. Papadimitriou, Mihalis Yannakakis · Mathematics of Operations Research · 1993 · 417 citations

Computing, Computer Science, Mathematics +12

The square of every two-connected graph is Hamiltonian

Herbert Fleischner · Journal of Combinatorial Theory Series B · 1974 · 180 citations

Natural Sciences, Mathematics, Condensed Matter Physics +7