Set Cover Problem

Problem Definition

Given a set $U$ of elements, a collection $S$ of subsets of $U$, and an integer $k$, are there $\le k$ of these subsets whose union is equal to $U$?