Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Lower Bounds for Insertion Methods for TSP

  • Yossi Azar
  • Journal:
    Combinatorics, Probability and Computing / Volume 3 / Issue 3 / September 1994
    Published online by Cambridge University Press:
    12 September 2008, pp. 285-292

  • 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.