Theorem 3.4 — given $\alpha \ge c(\mathcal C_{OPT})$, the algorithm never fails, covers every element of weight $\ge 1$, and pays $(6+o(1))\,\alpha\log m\log n$

Initializing...

Theorem 3.4 — given $\alpha \ge c(\mathcal C_{OPT})$, the algorithm never fails, covers every element of weight $\ge 1$, and pays $(6+o(1))\,\alpha\log m\log n$ · Prove2Me