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
引用
收藏
相关论文
共 7 条
  • [1] Surviving in Directed Graphs: A Quasi-Polynomial-Time Polylogarithmic Approximation for Two-Connected Directed Steiner Tree
    Grandoni, Fabrizio
    Laekhanukit, Bundit
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 420 - 428
  • [2] O(log2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
    Grandoni, Fabrizio
    Laekhanukit, Bundit
    Li, Shi
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 253 - 264
  • [3] A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs
    Borradaile, Glencora
    Kenyon-Mathieu, Claire
    Klein, Philip
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1285 - 1294
  • [4] A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
    Nakayama, Shin-ichi
    Masuyama, Shigeru
    INFORMATION PROCESSING LETTERS, 2007, 103 (06) : 216 - 221
  • [5] O(log2 k/log log k)-APPROXIMATION ALGORITHM FOR DIRECTED STEINER TREE: A TIGHT QUASI-POLYNOMIAL TIME ALGORITHM
    Grandonidagger, Fabrizio
    Laekhanukitddagger, Bundit
    Lis, Shi
    SIAM JOURNAL ON COMPUTING, 2023, 52 (02) : 298 - 322
  • [6] A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
    Bloch-Hansen, Andrew
    Page, Daniel R.
    Solis-Oba, Roberto
    COMBINATORIAL ALGORITHMS, IWOCA 2023, 2023, 13889 : 87 - 98
  • [7] A constant-factor approximation for directed latency in quasi-polynomial time
    Friggstad, Zachary
    Swamy, Chaitanya
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 126 : 44 - 58
1