New proofTheoretical computer science
Dinitz–Garg–Goemans flow conjecture
A seven-vertex, nine-arc witness: fractional cost 58; every allowed unsplittable routing costs at least 60, with demands 15,10,15.
LFCR
Frontier
New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.
Reports linked to Cost-preserving unsplittable flow · Show all