Worst-case bounds for subadditive geometric graphs

Marshall Wayne Bern and David Eppstein
Proc. 9th Symp. Computational Geometry, ACM, May 1993, pp. 183–188
Tech. report, Xerox Palo Alto Research Center,
http://www.ics.uci.edu/~eppstein/pubs/BerEpp-SCG-93.pdf

Cited by:

• Sums of squares of edge lengths and spacefilling curve heuristics for the traveling salesman problem
• A priori bounds on the Euclidean traveling salesman
• New results on the old $k$-opt algorithm for the TSP