Pages that link to "Item:Q2390272"
From MaRDI portal
The following pages link to Packing Steiner trees with identical terminal sets (Q2390272):
Displaying 4 items.
- Packing trees in communication networks (Q1016048) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Steiner connectivity problems in hypergraphs (Q6072212) (← links)