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
引用
收藏
相关论文
共 3 条
  • [1] 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):
  • [2] Fragmenting Steiner Tree Browsers Based on Ajax
    Lee, Wookey
    Su Song, Justin Jong
    Arora, Nidhi
    Kim, Young-Kuk
    ACM International Conference Proceeding Series, 2011,
  • [3] Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
    Mahabadi, Sepideh
    Roghani, Mohammad
    Tarnawski, Jakub
    Vakilian, Ali
    arXiv,
1