Algorithms for NP-Hard Problems (Section 22.6: The TSP Is NP-Hard)
Tim Roughgarden Lectures · 12:31
This lecture (Algorithms Illuminated, Part 4, §22.6) proves the traveling salesman problem is NP-hard by a polynomial-time reduction from undirected \(s\)-\(t\) Hamiltonian path: add a hub vertex \(v0\) adjacent only...