Edge capacity augmentation problem on spanning trees in networks
From MaRDI portal
Recommendations
- Edge-connectivity augmentation and network matrices
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- scientific article; zbMATH DE number 871953
- Increasing the Weight of Minimum Spanning Trees
This page was built for publication: Edge capacity augmentation problem on spanning trees in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980319)