Optimum Branching Problem Revisited

Maxim A. Babenko, Pavel V. Nalivaiko

Given a digraph $G=(V_G,A_G)$, a \emph{branching} in $G$ is a set of arcs $B\subseteq A_G$ such that the underlying undirected graph spanned by $B$ is acyclic and each node in…