Skip to content

APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS: Analysis of a Greedy Knapsack Heuristic 1

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