论文信息 - On the Travelling Salesperson Problem in Many Dimensions

On the Travelling Salesperson Problem in Many Dimensions

Consider d ⩾ 2, and m points X1, …, Xm that are independent uniformly distributed in [0, 1]d. It is well known that the length Tm of the shortest tour through X1, …, Xm satisfies limm∞ E(Tm)/m1−1/d = β(d) for a certain number β(d). We show that for some numerical constant K, .

Wansoo T. Rhee | WanSoo T. Rhee

[1] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[2] János Komlós,et al. On optimal matchings , 1984, Comb..

[3] D. Bertsimas,et al. An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability , 1990 .

[4] D. Bertsimas,et al. The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach , 1992 .