Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree
arXiv: Data Structures and Algorithms, Volume abs/1611.01644, 2016.
In this paper, we study a survivable network design problem on directed graphs, 2-Connected Directed Steiner Tree (2-DST): given an $n$-vertex weighted directed graph, a root $r$, and a set of $h$ terminals $S$, find a min-cost subgraph $H$ that has two edge/vertex disjoint paths from $r$ to any $tin S$. 2-DST is a natural generalization ...More
Full Text (Upload PDF)
PPT (Upload PPT)