Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Papadimitriou et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: