ConceptTheory & Algos
Greedy heuristic for set cover
An iterative approach that repeatedly picks the largest available subset and removes its elements from the universe and remaining subsets until all elements are covered.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Heuristic algorithms1Set cover1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.