Pages that link to "Item:Q925137"

The following pages link to An approximate max-Steiner-tree-packing min-Steiner-cut theorem (Q925137):

Displayed 9 items.

• Packing Steiner trees (Q273179) ‎ (← links)
• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) ‎ (← links)
• Packing Steiner trees on four terminals (Q602710) ‎ (← links)
• Spanning trees: A survey (Q659663) ‎ (← links)
• Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) ‎ (← links)
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) ‎ (← links)
• Steiner tree packing number and tree connectivity (Q1752665) ‎ (← links)
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) ‎ (← links)
• Edge disjoint Steiner trees in graphs without large bridges (Q3652550) ‎ (← links)