Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant

@inproceedings{Jaillet1990CubeVT,
  title={Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant},
  author={Patrick Jaillet},
  year={1990}
}
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 tree problem (MST), etc. Application of this result helps closing down one open question: We prove that the analytical expression recently obtained by Avram and Bertsimas for the MST constant in the d… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges

J. Steele
  • Ann. Proba.,
  • 1988
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

On the Largest Edge in a Minimum Spanning Tree in the Square

G. Caplain, P. Jaillet
  • Working Note. Laboratoire de Mathematiques et Modelisation, Ecole Nationale des Ponts et Chaussees,
  • 1990
VIEW 2 EXCERPTS

Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane

R. Karp
  • Math. Oper. Res.,
  • 1977
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…