Sign inSign in

Set cover problem

A problem where given a universe of elements and a family of subsets, the goal is to find the minimum number of subsets whose union covers the entire universe.
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.

NP-completeness1Set theory1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    3

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

    Concepts2

    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.