Hardness and approximation results for packing steiner trees

被引：0
|
作者：
Joseph Cheriyan
Mohammad R. Salavatipour
机构：
[1] University of Waterloo,Department of Combinatorics and Optimization
[2] University of Alberta,Department of Computing Science
来源：
Algorithmica | 2006年 / 45卷
关键词：
Steiner trees; Packing problems; Approximation algorithms; Hardness of approximation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study approximation algorithms and hardness of approximation for several versions of the problem of packing Steiner trees. For packing edge-disjoint Steiner trees of undirected graphs, we show APX-hardness for four terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee ofO (√n logn), wheren denotes the number of nodes. For the directed setting (packing edge-disjoint Steiner trees of directed graphs), we show a hardness result of Θ(m1/3/−ɛ) and give an approximation guarantee ofO(m1/2/+ɛ), wherem denotes the number of edges. We have similar results for packing Steiner-node-disjoint priority Steiner trees of undirected graphs.
引用
收藏
页码：21 / 43
页数：22
相关论文
共 50 条
  • [1] Hardness and approximation results for packing Steiner trees
    Cheriyan, J
    Salavatipour, MR
    [J]. ALGORITHMICA, 2006, 45 (01) : 21 - 43
  • [2] Hardness and approximation results for packing Steiner trees
    Cheriyan, J
    Salavatipour, MR
    [J]. ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 180 - 191
  • [3] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    Aazami, A.
    Cheriyan, J.
    Jampani, K. R.
    [J]. ALGORITHMICA, 2012, 63 (1-2) : 425 - 456
  • [4] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    A. Aazami
    J. Cheriyan
    K. R. Jampani
    [J]. Algorithmica, 2012, 63 : 425 - 456
  • [5] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    Aazami, Ashkan
    Cheriyan, Joseph
    Jampani, Krishnam Raju
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 1 - +
  • [6] Hardness and approximation of octilinear Steiner trees
    Müller-Hannemann, M
    Schulze, A
    [J]. ALGORITHMS AND COMPUTATION, 2005, 3827 : 256 - 265
  • [7] Hardness and approximation of octilinear Steiner trees
    Mueller-Hannemann, Matthias
    Schulze, Anna
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2007, 17 (03) : 231 - 260
  • [8] Packing Steiner trees
    Jain, K
    Mahdian, M
    Salavatipour, MR
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 266 - 274
  • [9] Packing Steiner trees
    DeVos, Matt
    McDonald, Jessica
    Pivotto, Irene
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 178 - 213
  • [10] Packing Steiner trees: A cutting plane algorithm and computational results
    Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, Berlin, 14195, Germany
    [J]. Math Program Ser B, 2 (125-145):
12345