From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

被引：0
|
作者：
Chekuri, Chandra [1 ]
Jain, Rhea [1 ]
Kulkarni, Shubhang [1 ]
Zheng, Da Wei [1 ]
Zhu, Weihao [1 ]
机构：
[1] University of Illinois, Urbana-Champaign,IL, United States
来源：
Leibniz International Proceedings in Informatics, LIPIcs | / 308卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Directed graphs
引用
收藏
相关论文
共 50 条
  • [21] 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
  • [22] Surviving in directed graphs: A quasi-polynomial-time polylogarithmic approximation for two-connected directed steiner tree
    IDSIA, USI-SUPSI, Switzerland
    不详
    Proc. Annu. ACM Symp. Theory Comput., 1600, (420-428):
  • [23] Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
    Suchy, Ondrej
    ALGORITHMICA, 2017, 79 (01) : 189 - 210
  • [24] Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
    Ondřej Suchý
    Algorithmica, 2017, 79 : 189 - 210
  • [25] Improved Steiner tree approximation in graphs
    Robins, G
    Zelikovsky, A
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 770 - 779
  • [26] Directed convergence heuristic: A fast & novel approach to Steiner tree construction
    Chakraverty, Shampa
    Batra, Arvind
    Rathi, Aman
    IFIP VLSI-SOC 2006: IFIP WG 10.5 INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION & SYSTEM-ON-CHIP, 2006, : 255 - +
  • [27] 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
  • [28] The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
    Du, DZ
    Wang, LS
    Xu, BA
    COMPUTING AND COMBINATORICS, 2001, 2108 : 509 - 518
  • [29] TREE GRAPHS OF DIRECTED GRAPHS
    RAO, VVB
    RAJU, NN
    IEEE TRANSACTIONS ON CIRCUIT THEORY, 1972, CT19 (03): : 282 - &
  • [30] Homogeneously orderable graphs and the Steiner tree problem
    Brandstadt, A
    Dragan, FF
    Nicolai, F
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 381 - 395
12345