Let be a collection of subsets of a finite set . The smallest subset of that meets every member of is called the hitting set or Vertex Cover. Finding the hitting set is an NP-Complete Problem.