P
Initializing...
Theorem 3, p. 7 — Randomized-Batching with Depth-k Greedy is 1/d-competitive for Online-(k, d)-Max-Matching · Prove2Me