arxiv.org
Breaking the Barrier: A Polynomial-Time Polylogarithmic Approximation for Directed Steiner Tree
The Directed Steiner Tree (DST) problem is defined on a directed graph $G=(V,E)$, where we are given a designated root vertex $r$ and a set of $k$ terminals $K \subseteq V \setminus {r}$. The goal is ...