Theorem 3.1 — the LP-rounding-and-splitting algorithm is a 3k-approximation, k = ⌊3 log m / log log m⌋, for complement-free bidders

Initializing...

Theorem 3.1 — the LP-rounding-and-splitting algorithm is a 3k-approximation, k = ⌊3 log m / log log m⌋, for complement-free bidders · Prove2Me