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

DOI10.1016/S0167-7152(99)00147-9zbMath1063.90058MaRDI QIDQ1974077

Tony Robinson, Mario Cortina-Borja

Publication date: 2000

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem

Cites Work

• An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Asymptotics for Euclidean minimal spanning trees on random points
• Random minimal trees
• Unnamed Item

This page was built for publication: Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges.