An approximate max-Steiner-tree-packing min-Steiner-cut theorem
From MaRDI portal
Publication:925137
DOI10.1007/s00493-007-0044-3zbMath1136.05011MaRDI QIDQ925137
Publication date: 29 May 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0044-3
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W25: Approximation algorithms
05C40: Connectivity
Related Items
Packing Steiner trees, Parameterized complexity dichotomy for \textsc{Steiner Multicut}, Packing Steiner trees on four terminals, Spanning trees: A survey, Packing of Steiner trees and \(S\)-connectors in graphs, On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices, Steiner tree packing number and tree connectivity, Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs, Edge disjoint Steiner trees in graphs without large bridges