A simplified min-max formula for the inverse arborescence problem
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 digraph a cheapest arborescence. The constructive proof gives rise to a polynomial time algorithm for computing both a minimizer cost function on the primal side and a maximizer dual object in the min-max formula.
math.CO↗