On the asymptotic of the length of commercial traveller's path when towns are randomly allocated

Let $n$ points in $R^k$ be independent and identically distributed. The paper is concerned with the well known problem of finding a cycle of minimal length that passes every point. Upper and lower bounds for the expectation of the length as $n\to\infty$ of this cycle are given. The bounds have equal growth rates. An algorithm is given to determine a cycle with average length between the bounds.