Affiliation:
1. University of Waterloo, Ontario, Canada
2. University of Alberta, Alberta, Canada
Abstract
Given an undirected graph
G
(
V
,
E
) with terminal set
T
⊆
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 Ω(log
n
), where
n
denotes |
V
|. 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference21 articles.
1. Arora S. and Lund C. 1996. Hardness of approximations. In Approximation Algorithms for NP-Hard Problems D. Hochbaum ed. PWS. Arora S. and Lund C. 1996. Hardness of approximations. In Approximation Algorithms for NP-Hard Problems D. Hochbaum ed. PWS.
2. Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
3. Randomized metarounding
4. Hardness and approximation results for packing steiner trees
5. Diestel R. 2000. Graph Theory. Springer New York. Diestel R. 2000. Graph Theory. Springer New York.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献