Packing Steiner trees on four terminals

Authors:
Matthias Kriesell
Affiliations:
Math. Sem. d. Univ. Hamburg, Bundesstraíe 55, D-20146 Hamburg, Germany
Venue:
Journal of Combinatorial Theory Series B
Year:
2010

Citing 6
Cited 0

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
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem

Combinatorica
On approximate min-max theorems for graph connectivity problems

On approximate min-max theorems for graph connectivity problems
Hardness and approximation results for packing steiner trees

Algorithmica
Edge disjoint Steiner trees in graphs without large bridges

Journal of Graph Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Let A be a set of vertices of some graph G. An A-tree is a subtree of G containing A, and A is called k-edge-connected in G if every set of less than k edges in G misses at least one A-tree. We prove that every @?3k2@?-edge-connected set A of four vertices in a graph admits a set of k edge disjoint A-trees. The bound @?3k2@? is best possible for all k1.