Exact four-terminal planar lower bound and verifiers for cost-preserving unsplittable-flow rounding.
-
Updated
Sep 2, 2026 - Python
#
unsplittable-flow
Here are 3 public repositories matching this topic...
Lean 4 formalization and reproducibility artifact: How Far Can Goemans's Cost Conjecture Fail? (rho(H*) = 2/(2*sqrt(2)-1), exact and not attained)
reproducible-research formal-verification combinatorial-optimization network-flows lean4 unsplittable-flow
-
Updated
Jul 23, 2026 - Lean
Exact verification code for the counterexample to Goemans' unsplittable-flow cost conjecture and the suprema of its three-parameter family (companion to Zenodo record)
-
Updated
Sep 1, 2026 - Python
Add this topic to your repo
To associate your repository with the unsplittable-flow topic, visit your repo's landing page and select "manage topics."