On the equivalence of constrained and unconstrained flows (Q1339398): Difference between revisions

The authors examine the problem of minimum-cost linear flow problem with a single side constraint. They give a linear-time algorithm for converting such a problem into a set of independent pure flow problems (without side constraints) and at most a single constrained flow problem. The problems are to be solved on subgraphs of the original graph and in that sense, the reduction is shown to be minimal.