Proposition 4.2 — for $n \ge 2^{k+1}kr^2$ and $2^{2^k kr^2} \ge m \ge \binom{kr^2}{r}k^r$, every deterministic algorithm has competitive ratio $\ge kr$

Initializing...

Proposition 4.2 — for $n \ge 2^{k+1}kr^2$ and $2^{2^k kr^2} \ge m \ge \binom{kr^2}{r}k^r$, every deterministic algorithm has competitive ratio $\ge kr$ · Prove2Me