P

Initializing...

Theorem 4.1 — Algorithm 1 (basic discrete algorithm): $2\log_2(3d+1)$-competitive covering solution, $2$-competitive integral packing solution with violation $\le \log_2(3d+1)$ · Prove2Me