An approximate max-Steiner-tree-packing min-Steiner-cut theorem
DOI10.1007/S00493-007-0044-3zbMATH Open1136.05011OpenAlexW2097945626MaRDI QIDQ925137FDOQ925137
Authors: Chi Lau Lap 
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
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Directed Steiner tree packing and directed tree connectivity
- Steiner tree packing number and tree connectivity
- Packing Steiner trees
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Spanning trees: A survey
- Packing of Steiner trees and \(S\)-connectors in graphs
- Edge disjoint Steiner trees in graphs without large bridges
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- Edge-disjoint Steiner trees and connectors in graphs
- Packing Steiner trees on four terminals
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- Packing Steiner Forests
- Title not available (Why is that?)
- Approximate integer decompositions for undirected network design problems
- On the Edge-Erdős–Pósa Property of Ladders
- Hamilton cycles in line graphs of 3-hypergraphs
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Packing strong subgraph in digraphs
- The \(\kappa_k\)-connectivity of line graphs
This page was built for publication: An approximate max-Steiner-tree-packing min-Steiner-cut theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925137)
