Lower Bounds for Insertion Methods for TSP

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)285-292
Number of pages8
JournalCombinatorics Probability and Computing
Volume3
Issue number3
DOIs
StatePublished - Sep 1994

Fingerprint

Dive into the research topics of 'Lower Bounds for Insertion Methods for TSP'. Together they form a unique fingerprint.

Cite this