| dc.creator |
Avram, Florin |
|
| dc.creator |
Bertsimas, Dimitris J. |
|
| dc.date |
2004-05-28T19:27:12Z |
|
| dc.date |
2004-05-28T19:27:12Z |
|
| dc.date |
1990-04 |
|
| dc.date.accessioned |
2013-10-09T02:38:14Z |
|
| dc.date.available |
2013-10-09T02:38:14Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5189 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
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 determine the constant 3MST(d). In this paper we obtain an exact expression of the constant MST(d) as a series expansion. Truncating the expansion after a finite number of terms yields a sequence of lower bounds; the first 3 terms give a lower bound which is already very close to the empirically estimated value of the constant. Our proof technique unifies the derivation for the MST asymptotic behavior for the Euclidean and the independent model. |
|
| dc.format |
828803 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 211-90 |
|
| dc.title |
The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach |
|
| dc.type |
Working Paper |
|