Decision-Problem Version

The decision-problem version is ``Is there a set cover of size k or smaller?''

How could you use an algorithm for this to find the minimum set cover? Assume n people.

• Binary search: $\log n$ queries.
• Self-reduction: n queries to see who is needed.

Try it.