P

Initializing...

The greedy set cover bound (§2.3): after i steps at most (1 − 1/opt)^i |U| elements are uncovered, and opt ln|U| sets cover U · Prove2Me