The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach
Given n uniformly and independently points in the d dimensional cube of unit volume, it is well established that the length of the minimum spanning tree on these n points is asymptotic to /3MsT(d)n(d-l)/d,where the constant PMST(d) depends only on the dimension d. It has been a major open problem to...
Main Authors: | Avram, Florin, Bertsimas, Dimitris J. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5189 |
Similar Items
-
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
Published: (2003) -
On central limit theorems in geometrical probability
by: Avram, Florin., et al.
Published: (2009) -
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
by: Bertsimas, Dimitris
Published: (2009) -
The Probabilistic Minimum Spanning Tree, Part II: Probabilistic Analysis and Asymptotic Results
by: Bertsimas, Dimitris J.
Published: (2004) -
A Unified Approach to Analysis of MRI Radiomics of Glioma Using Minimum Spanning Trees
by: Olivier B. Simon, et al.
Published: (2022-05-01)