Skip to content

APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS: A Dynamic Programming Heuristic for Knapsack

Video by Stanford Algorithms, played through YouTube's embedded player.