On Two Geometric Problems Related to the Traveling Salesman Problem
暂无分享,去创建一个
[1] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[4] Kenneth Steiglitz,et al. Some complexity results for the Traveling Salesman Problem , 1976, STOC '76.
[5] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[6] M. Fisher. Worst-Case Analysis of Heuristic Algorithms , 1980 .
[7] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[8] Ján Plesník,et al. The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..