论文信息 - Complete Convergence of Short Paths and Karp's Algorithm for the TSP

Complete Convergence of Short Paths and Karp's Algorithm for the TSP

Let Xi, 1 ≤ i 0 $$\sum^{\infty}_{n=1}p\left|T_{n}/\sqrt{n-\beta}| \gt \epsilon\right \lt \infty.$$ This result is essential in justifying Karp's algorithm for the traveling salesman problem under the independent model, and it settles a question posed by B. W. Weide.

J. Michael Steele | J. Steele

[1] B. Weide. Statistical methods in algorithm design and analysis. , 1978 .

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

[3] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[4] P. H. Müller. E. Lukacs, Stochastic Convergence. (Heath Mathematical Monographs). VI + 142 S. Lexington, Mass. 1968. D. C. Heath and Company. Preis geb. $ 6.95 . , 1970 .

[5] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[6] H Robbins,et al. Complete Convergence and the Law of Large Numbers. , 1947, Proceedings of the National Academy of Sciences of the United States of America.

[7] B. Efron,et al. The Jackknife Estimate of Variance , 1981 .

[8] L. Few. The shortest path and the shortest road through n points , 1955 .