Packing Element-Disjoint Steiner Trees

被引：21
|
作者：
Cheriyan, Joseph [1 ]
Salavatipour, Mohammad R. [2 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
来源：
ACM TRANSACTIONS ON ALGORITHMS | 2007年 / 3卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Packing; Steiner trees; element-disjoint; approximation algorithms; hardness of approximation;
D O I：
10.1145/1290672.1290684
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given an undirected graph G(V, E) with terminal set T subset of V, the problem of packing element-disjoint Steiner trees is to find the maximum number of Steiner trees that are disjoint on the nonterminal nodes and on the edges. The problem is known to be NP-hard to approximate within a factor of Omega(log n), where n denotes vertical bar V vertical bar. We present a randomized O(log n)-approximation algorithm for this problem, thus matching the hardness lower bound. Moreover, we show a tight upper bound of O(log n) on the integrality ratio of a natural linear programming relaxation.
引用
收藏
页数：10
相关论文
共 50 条
  • [1] Packing element-disjoint Steiner trees
    Cheriyan, J
    Salavatipour, MR
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 52 - 61
  • [2] Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
    Hoshika, Daiki
    Miyano, Eiji
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 100 - 111
  • [3] Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
    Hoshika, Daiki
    Miyano, Eiji
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (06) : 1059 - 1066
  • [4] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    A. Aazami
    J. Cheriyan
    K. R. Jampani
    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
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 1 - +
  • [6] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    Aazami, A.
    Cheriyan, J.
    Jampani, K. R.
    ALGORITHMICA, 2012, 63 (1-2) : 425 - 456
  • [7] Packing Steiner trees
    Jain, K
    Mahdian, M
    Salavatipour, MR
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 266 - 274
  • [8] Packing Steiner trees
    DeVos, Matt
    McDonald, Jessica
    Pivotto, Irene
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 178 - 213
  • [9] Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
    Uchoa, E
    de Aragao, MP
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 439 - 452
  • [10] Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
    Uchoa, E
    de Aragao, MP
    MATHEMATICAL PROGRAMMING, 2001, 90 (03) : 537 - 557
12345