A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem ยท HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1708.04215/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem โ€” mentioned by rocquahttps://news.ycombinator.com/item?id=15417724urn:hackerpapers:mention:1708.04215:15417724Fri, 06 Oct 2017 15:49:23 GMT<p>This [1] seems to be the paper they are referring to on arxiv. [1] https://arxiv.org/abs/1708.04215</p><p><a href="https://hackerpaper.kaipfister.de/p/1708.04215/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DSA Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem โ€” HN submissionhttps://news.ycombinator.com/item?id=15237600urn:hackerpapers:submission:1708.04215:15237600Wed, 13 Sep 2017 12:27:54 GMT<p>A TSP breakthrough โ€“ constant approximation algorithm</p><p></p><p>2 points; 1 discussion reply on HN. <a href="https://hackerpaper.kaipfister.de/p/1708.04215/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS