P
Initializing...
Theorem 4.1 (p. 226) — every multicommodity network has a cut with Cap(S)/Dem(S) ≤ O(log k) · maxflow · Prove2Me