Question: 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

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 at most b which intersects every Si, if such an H exists. In other words, we want H S, for all i. Show that hitting set is NP-complete.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!