https://hackerpaper.kaipfister.de/p/1303.6437/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=16459887urn:hackerpapers:mention:1303.6437:16459887Sun, 25 Feb 2018 17:08:54 GMT<p>For traveling salesmen problem there is Christofides algorithm which gives result that is no longer than 3/2 of optimal one. Theoretical bound on inapproximability of symmetrical TSP currently is 185/184. https://arxiv.org/abs/1303.6437</p><p><a href="https://hackerpaper.kaipfister.de/p/1303.6437/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC