Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]
Tim Roughgarden Lectures · 12:45
This lecture (Algorithms Illuminated Part 4, §20.4) builds a TSP heuristic from scratch: TSP is NP-hard, and a fast algorithm with an approximation guarantee would refute P≠NP, so unlike makespan, maximum coverage, an...