Dinitz–Garg–Goemans conjecture
Statement
Let be a directed graph with a distinguished source , a set of terminals , and a demand for each . A flow with is called feasible (splittable, or fractional) for this instance if it satisfies flow conservation and routes units from to for every simultaneously; that is, is a nonnegative combination of – path flows whose total value into each terminal equals , with each demand possibly divided among several paths. A flow is called unsplittable if there is a choice of a single – path for each such that
so that the entire demand of each terminal travels along one path. Put .
For every such instance, every fractional flow feasible for it, and every cost vector with for all , there exists an unsplittable flow satisfying the same demands such that
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.