Abstract
We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour Ω(log log n/log log log n) times longer than the optimal tour. The lower bound holds even in the Euclidean Plane. This is in contrast to the fact that the random insertion method performs extremely well in practice. In passing, we show that other insertion methods may produce tours Ω(log n/log log n) times longer than the optimal one. No non-constant lower bounds were previously known.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference13 articles.
1. An Analysis of Several Heuristics for the Traveling Salesman Problem
2. On-line steiner trees in the Euclidean plane
3. [2] Bafna V. , Kalyanasundaram B. and Pruhs K. (manuscript) Not all insertion methods yield constant approximate tours in the Euclidean plane.
4. Approximate Traveling Salesman Algorithms
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献