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

Mario Cortina-Borja and Tony Robinson

Statistics & Probability Letters, 2000, vol. 47, issue 2, 125-128

Abstract: Steele (1988, Ann. Probab. 16, 1767-1787) and Aldous and Steele (1992, Probab. Theory Related Fields 92, 247-258) have proved that the total length of several combinatorial optimization problems in involving trees with n nodes and [alpha]-power-weighted edges is asymptotically c(p,[alpha])n(p-[alpha])/p, where 0

Keywords: Minimal; spanning; tree; Euclidean; spaces; Probabilistic; analysis (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(99)00147-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:47:y:2000:i:2:p:125-128

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().