scientific article; zbMATH DE number 508829
From MaRDI portal
Publication:4280133
Recommendations
Cited in
(5)- scientific article; zbMATH DE number 1538622 (Why is no real title available?)
- Hardness and approximation results for packing Steiner trees
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- On routing in VLSI design and communication networks
- Packing trees in communication networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4280133)