Pages that link to "Item:Q752004"

The following pages link to An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (Q752004):

Displaying 8 items.

• The random minimal spanning tree in high dimensions (Q674507) (← links)
• Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space (Q1336762) (← links)
• Continuum percolation and Euclidean minimal spanning trees in high dimensions (Q1814749) (← links)
• An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250) (← links)
• Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges. (Q1974077) (← links)
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem (Q4492397) (← links)
• Randomized algorithms for the on-line minimum matching problem on euclidean space (Q4876378) (← links)