How to Approximate Traveling Salesman Under 2x Optimal Cost in O(N^3) | Hacker News Reader