Counterexample to Goemans' unsplittable-flow cost conjecture

Source: arxiv:2308.02651, url:https://github.com/jyh/dinitz-verify/tree/ffba3523f0edd14be3460d039f22a6b98c02fd9e Authors: Jason Hickey Status: verified Main declarations: GoemansFlow.goemans_cost_conjecture_false Tags: network-flows, combinatorial-optimization, counterexamples MSC: 90C35, 05C21