A set of sets whose union has all members of the union of all sets. The set cover problem is to find a minimum size set. Formal Definition: Given a set S of sets, choose c ⊆ S such that U_i=1 c_i = U_i=1 S_i.