Maxim A. Babenko

collaborators

2 papers

math.CO2023

Packing Odd Walks and Trails in Multiterminal Networks

Maxim Akhmedov, Maxim Babenko

Let $G$ be an undirected network with a distinguished set of terminals $T \subseteq V (G)$ and edge capacities $c a p : E (G) \to R_{+}$ . By an odd $T$ -walk we mean a wal…

math.CO2006

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…