Show that for any integer n that is a power of 2, there is an instance of the set cover problem (Section 5.4) with the following properties:
i. There are n elements in the base set.
ii. The optimal cover uses just two sets.
iii. The greedy algorithm picks at least log n sets.
Thus the approximation ratio we derived in the chapter is tight.
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.