In the HITTING SET problem, we are given a family of sets {S1,S2,..., Sn} and a budget b, and we wish to find a set H of size ≤ b which intersects every Si, if such an H exists. In other words, we want H ∩ Si≠ ∅ for all i.
Show that HITTING SET is NP-complete.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.