Multi-Level Steiner Trees

Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh +8

In the classical Steiner tree problem, given an undirected, connected graph $G=(V,E)$ with non-negative edge costs and a set of \emph{terminals} $T\subseteq V$, the objective is to…