The Probabilistic Minimum Spanning Tree, Part II: Probabilistic Analysis and Asymptotic Results
In this paper, which is a sequel to [3], we perform probabilistic analysis under the random Euclidean and the random length models of the probabilistic minimum spanning tree (PMST) problem and the two re-optimization strategies, in which we find the MST or the Steiner tree respectively among the poi...
Main Author: | 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/5284 |
Similar Items
-
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
by: Bertsimas, Dimitris
Published: (2009) -
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
Published: (2004) -
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
Published: (2003) -
Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem
by: Goemans, Michel X., et al.
Published: (2009) -
The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach
by: Avram, Florin, et al.
Published: (2004)