Surviving in directed graphs: A quasi-polynomial-time polylogarithmic approximation for two-connected directed steiner tree

被引：0

作者：

IDSIA, USI-SUPSI, Switzerland ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Proc. Annu. ACM Symp. Theory Comput. | 1600年 / 420-428期

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Graphic methods - Iterative methods - Computation theory - Network architecture - Trees (mathematics) - Directed graphs - Polynomial approximation - Undirected graphs

引用