Set-Covering Problem

Given a finite set X and a family F of subsets of X, X = , find a minimum-size subset C $\subseteq$ F whose members cover all of X.

SC = {$\langle$X, F, k$\rangle$$\mid$ there exists a set cover C $\subseteq$ F covering X with size $\leq$ k}