Answers are grounded in this paper and cite their sources.
A limit theorem is established for a class of random processes (called here subadditive Euclidean functionals) which arise in problems of geometric probability. Particular examples include the length of shortest path through a random sample, the length of a rectilinear Steiner tree spanned by a sample, and the length of a minimal matching. Also, a uniform convergence theorem is proved which is needed in Karp's probabilistic algorithm for the traveling salesman problem.
No takes yet. Share an insight, caveat, or question.
John Steele (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: