Pages that link to "Item:Q2369873"

The following pages link to Hardness and approximation results for packing Steiner trees (Q2369873):

Displaying 8 items.

• The data transfer problem in a system of systems (Q319366) (← links)
• Packing Steiner trees on four terminals (Q602710) (← links)
• Extremal results for directed tree connectivity (Q2117576) (← links)
• Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs (Q2151209) (← links)
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
• Packing strong subgraph in digraphs (Q2684051) (← links)
• (Q5002841) (← links)
• Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)