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
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
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
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
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Disjoint bases in a polymatroid
Random Structures & Algorithms
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.