An Improved Lower Bound for the Traveling Salesman Constant
Abstract
Let X1, X2, …, Xn be independent uniform random variables on [0,1]2. Let L(X1, …, Xn) be the length of the shortest Traveling Salesman tour through these points. It is known that there exists a constant β such that n ∞ L(X1, …, Xn)n = β almost surely (Beardwood 1959). The original analysis in (Beardwood 1959) showed that β ≥ 0.625. Building upon an approach proposed in (Steinerberger 2015), we improve the lower bound to β ≥ 0.6277.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.