✦ LIBER ✦

Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges

✍ Scribed by Mario Cortina-Borja; Tony Robinson

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 80 KB
Volume: 47
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(99)00147-9

No coin nor oath required. For personal study only.

✦ Synopsis

Steele (1988

, Ann. Probab. 16, 1767-1787)

has proved that the total length of several combinatorial optimization problems in R p involving trees with n nodes and -power-weighted edges is asymptotically c(p; )n (p-)=p , where 0 ¡ 6p. In this paper we obtain bounds for these constants and give estimates for c(p;