Published in Volume XVI, 2006, pages 51-62

Authors: Adrian Deaconu


Starting from a given feasible flow $f$ in a network $G$,
the least number of modifications to the (lower or/and upper)
arc capacities is searched so that if these modifications
are applied, then $f$ becomes a maximum flow in $G$. If there
are no great restrictions in modifying the capacities of the
arcs, the problem is reduced to a minimum cut problem in a unit
capacity network. Some special cases of the problem are separately discussed.


  title={A Cardinality Inverse Maximum Flow Problem.},
  author={Adrian Deaconu},
  journal={Scientific Annals of Computer Science},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  publisher={``A.I. Cuza'' University Press}