A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
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
On decomposing a hypergraph into k connected sub-hypergraphs
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
Edge disjoint Steiner trees in graphs without large bridges
Journal of Graph Theory
Approximate Integer Decompositions for Undirected Network Design Problems
SIAM Journal on Discrete Mathematics
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory Series B
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
| Hi-index | 0.00 |
Given an undirected multigraph G and a set $\mathcal{S}:=\{S_{1},...,S_{t}\}$ of disjoint subsets of vertices of G, a Steiner $\mathcal{S}$-forest F is an acyclic subgraph of G such that each Si is connected in F for 1 ≤ i ≤ t. In this paper, we study the Steiner Forest Packing problem where we seek a largest collection of edge-disjoint $\mathcal{S}$-forests. The main result is a connectivity-type sufficient condition for the existence of k edge-disjoint $\mathcal{S}$-forest, that yields the first polynomial time approximation algorithm for the Steiner Forest Packing problem. We end this paper by a conjecture in a more general setting.