Terminal Steiner tree problem : Complexity and Algorithms

Jyothish S, Sadagopan Narasimhan

Given a connected graph $G$ and a terminal set $R\subseteq V(G)$, the Steiner tree problem (ST) asks for a tree that spans all of $R$ with at most $r$ vertices from $V(G)\backslas…