A simplified min-max formula for the inverse arborescence problem

András Frank, Hanna Szabrina Horváth

A simple min-max theorem is formulated and proved for the smallest modification (measured in $l_1$-norm) of an input cost function $w_0$ that makes a target arborescence $F_0$ of a…