Type: Article
Publication Date: 1989-01-01
Citations: 49
DOI: https://doi.org/10.1214/aop/1176991490
Let $T_n$ denote the length of the shortest closed path connecting $n$ random points uniformly distributed over the unit square. We prove that for some number $K$, we have, for all $t \geq 0$, $P(|T_n - E(T_n)| \geq t) \leq K \exp(-t^2/K).$
Action | Title | Year | Authors |
---|---|---|---|
+ PDF Chat | Complete Convergence of Short Paths and Karp's Algorithm for the TSP | 1981 |
John Steele |