Sign inSign in

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.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.