论文信息 - The Euclidean Traveling Salesman Problem is NP-Complete - 字舞流文

The Euclidean Traveling Salesman Problem is NP-Complete

Christos H. Papadimitriou | C. Papadimitriou

[1] Kenneth Steiglitz,et al. On the Complexity of Local Search for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[2] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.

[3] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.

[4] Teofilo F. Gonzalez,et al. P-Complete Problems and Approximate Solutions , 1974, SWAT.

[5] David S. Johnson,et al. Some simplified NP-complete problems , 1974, STOC '74.

[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[7] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[8] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.