Lee, Sungchul - In: Stochastic Processes and their Applications 79 (1999) 1, pp. 109-116
Let {Xi: i[greater-or-equal, slanted]1} be i.i.d. points in , d[greater-or-equal, slanted]2, and let LMM({X1,...,Xn},p), LMST({X1,...,Xn},p), LTSP({X1,...,Xn},p), be the length of the minimal matching, the minimal spanning tree, the traveling salesman problem, respectively, on {X1,...,Xn} with...