Pages that link to "Item:Q3057108"
From MaRDI portal
The following pages link to Packing the Steiner trees of a graph (Q3057108):
Displaying 15 items.
- Packing Steiner trees (Q273179) (← 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)
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem (Q925137) (← links)
- On packing connectors (Q1272488) (← links)
- The Steiner tree packing problem in VLSI design (Q1373751) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- Bounds on the maximum number of edge-disjoint Steiner trees of a graph (Q2716516) (← links)
- The cavity approach for Steiner trees packing problems (Q3303270) (← links)
- (Q4023738) (← links)
- Packing element-disjoint steiner trees (Q4962687) (← links)