Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree.
Fabrizio GrandoniBundit LaekhanukitPublished in: STOC (2017)
Keyphrases
- directed graph
- steiner tree
- approximation algorithms
- undirected graph
- approximation ratio
- random walk
- special case
- minimum spanning tree
- directed acyclic graph
- shortest path
- linear programming relaxation
- np hard
- connected components
- disjoint paths
- strongly connected
- graph structure
- graph structures
- facility location
- np complete
- worst case
- computational complexity
- social networks