The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory.
Given a set of elements (henceforth referred to as the universe, specifying all possible elements under consideration) and a collection, referred to as, of a given subsets whose union equals the universe, the set cover problem is to identify a smallest sub-collection of whose union equals the universe.
For example, consider the universe,