How Long Can a Euclidean Traveling Salesman Tour Be?
- 1 February 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (1) , 91-99
- https://doi.org/10.1137/0402010
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the length of optimal TSP circuits in sets of bounded diameterJournal of Combinatorial Theory, Series B, 1984
- The Travelling Salesman Problem and Minimum Matching in the Unit SquareSIAM Journal on Computing, 1983
- On Steiner trees for bounded point setsGeometriae Dedicata, 1981
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- The shortest path and the shortest road through n pointsMathematika, 1955
- On the shortest path through a number of pointsProceedings of the American Mathematical Society, 1951