Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 1/2]
Tim Roughgarden Lectures · 20:10
This lecture from *Algorithms Illuminated* Part 4 (section 20.2) defines the maximum coverage problem—pick *k* of *m* subsets of a ground set *U* to maximize the size of their union—and presents the natural greedy cov...