Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree

STOC, pp. 420-428, 2017.

Cited by: 4|Bibtex|Views0|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments