Skip to content

APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS: Knapsack via Dynamic Programming Revisited

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