Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
For a sample of points drawn uniformly from either the d-dimensional torus or the d-cube, d > 2, we define a class of random processes with the property of being asymptotically equivalent in expectation in the two models. Examples include the traveling salesman problem (TSP), the minimum spanning...
Main Author: | Jaillet, Patrick |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5196 |
Similar Items
-
A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree
by: Jaillet, Patrick
Published: (2004) -
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
Published: (2004) -
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
by: Bertsimas, Dimitris
Published: (2009) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022)