论文信息 - The Traveling Salesman Problem with Distances One and Two

The Traveling Salesman Problem with Distances One and Two

We present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the special case of the traveling salesman problem in which all distances are either one or two. We also show that this special case of the traveling salesman problem is MAX SNP-hard, and therefore it is unlikely that it has a polynomial-time approximation scheme.

Mihalis Yannakakis | Christos H. Papadimitriou | M. Yannakakis | C. Papadimitriou

[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2] Tao Jiang,et al. Linear approximation of shortest superstrings , 1991, STOC '91.

[3] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

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