Hardness Results and Approximation Algorithms for the Minimum Dominating Tree Problem

Gilad Kutiel

Given an undirected graph $G=(V,E)$ and a weight function $w:E\to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T =…