The following pages link to (Q4280133):
Displaying 4 items.
- On routing in VLSI design and communication networks (Q944702) (← links)
- 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)