Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
STOC, pp. 420-428, 2017.
Directed Steiner treeapproximation algorithmssurvivable network designgroup Steiner tree
Real-word networks are often prone to failures. A reliable network needs to cope with this situation and must provide a backup communication channel. This motivates the study of survivable network design, which has been a focus of research for a few decades. To date, survivable network design problems on undirected graphs are well-underst...More
Full Text (Upload PDF)
PPT (Upload PPT)