Packing element-disjoint steiner trees

Authors:
Joseph Cheriyan;Mohammad R. Salavatipour
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
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
Year:
2005

Citing 18
Cited 1

A nearly best-possible approximation algorithm for node-weighted Steiner trees

Journal of Algorithms
Packing Steiner trees: further facets

European Journal of Combinatorics
Packing Steiner trees: polyhedral investigations

Mathematical Programming: Series A and B
Packing Steiner trees: a cutting plane algorithm and computational results

Mathematical Programming: Series A and B
Packing Steiner Trees: Separation Algorithms

SIAM Journal on Discrete Mathematics
Hardness of approximations

Approximation algorithms for NP-hard problems
The Steiner tree packing problem in VLSI design

Mathematical Programming: Series A and B
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
A primal-dual schema based approximation algorithm for the element connectivity problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Domatic Number

SIAM Journal on Computing
Packing Steiner trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-disjoint trees containing some given vertices in a graph

Journal of Combinatorial Theory Series B
Multicast time maximization in energy constrained wireless networks

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics - Submodularity
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

Discrete Applied Mathematics - Submodularity
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hardness and approximation results for packing steiner trees

Algorithmica
Packing steiner forests

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

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 Ω(logn), where n denotes |V|. We present a randomized O(logn)-approximation algorithm for this problem, thus matching the hardness lower bound. Moreover, we show a tight upper bound of O(logn) on the integrality ratio of a natural linear programming relaxation.