Hardness and approximation results for packing steiner trees

Authors:
Joseph Cheriyan;Mohammad R. Salavatipour
Affiliations:
University of Waterloo, Department of Combinatorics and Optimization, N2L 3G1, Waterloo, Ontario, Canada;University of Alberta, Department of Computing Science, T6G 2E8, Edmonton, Alberta, Canada
Venue:
Algorithmica
Year:
2006

Citing 0
Cited 7

Packing element-disjoint steiner trees

ACM Transactions on Algorithms (TALG)
A Graph Reduction Step Preserving Element-Connectivity and Applications

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Packing Steiner trees on four terminals

Journal of Combinatorial Theory Series B
Pairwise intersession network coding on directed networks

IEEE Transactions on Information Theory
Secret key generation for a pairwise independent network model

IEEE Transactions on Information Theory
Packing element-disjoint steiner trees

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Quantified Score

Hi-index	0.12

Visualization

Abstract

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 Θ(m 1/3/−ɛ) and give an approximation guarantee ofO(m 1/2/+ɛ), wherem denotes the number of edges. We have similar results for packing Steiner-node-disjoint priority Steiner trees of undirected graphs.