Traveling Salesperson Problem and the Held-Karp Dynamic Programming Algorithm
I start with a short introduction to the traveling salesperson problem (TSP) and briefly discuss the nearest-neighbor heuristic. The main part of the video then discusses the dynamic program by Held and Karp that solves the TSP in O(2^n n^2) time.
00:00 Introduction
02:55 Nearest-Neighbor Heuristic
06:01 Dynamic Programming Algorithm for TSP
10:35 Analysis
13:05 Example