Improving Minimum Cost Spanning Trees by Upgrading Nodes
From MaRDI portal
Recommendations
Cited in
(19)- Modifying edges of a network to obtain short subgraphs
- Approximation algorithms for certain network improvement problems
- Upgrading nodes in tree-shaped hub location
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Upgrading min-max spanning tree problem under various cost functions
- A class of node based bottleneck improvement problems
- On budget-constrained flow improvement.
- Improving multicut in directed trees by upgrading nodes
- The capacity expansion path problem in networks
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- scientific article; zbMATH DE number 1163718 (Why is no real title available?)
- Improving spanning trees by upgrading nodes
- Upgrading trees under diameter and budget constraints
- scientific article; zbMATH DE number 871953 (Why is no real title available?)
- Edge capacity augmentation problem on spanning trees in networks
- Upgrading bottleneck constrained forests
- The constrained Bottleneck spanning tree problem with upgrades
- Modifying networks to obtain low cost trees
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
This page was built for publication: Improving Minimum Cost Spanning Trees by Upgrading Nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939607)
