A New Approach for Approximating Directed Rooted Networks

Sarel Cohen, Lior Kamma, Aikaterini Niklanovits

We consider the k-outconnected directed Steiner tree problem (k-DST). Given a directed edge-weighted graph $G=(V,E,w)$, where $V=\{r\}\cup S\cup T$, and an integer $k$, the goal i…