Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 1/2]
Tim Roughgarden Lectures · 19:34
Exact algorithms for NP-hard problems keep correctness and give up speed; this lecture (Chapter 21 of *Algorithms Illuminated*, Part 4) starts that program by applying dynamic programming to TSP so an exact solver can...