A class of node based bottleneck improvement problems
From MaRDI portal
Recommendations
Cites work
- A class of bottleneck expansion problems
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for certain network improvement problems
- Bottleneck capacity expansion problems with general budget constraints
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- Improving spanning trees by upgrading nodes
- Lowering eccentricity of a tree by node upgrading
- Modifying edges of a network to obtain short subgraphs
- Network flows. Theory, algorithms, and applications.
- Optimization, approximation, and complexity classes
- Upgrading bottleneck constrained forests
- Weight reduction problems with certain bottleneck objectives.
Cited in
(4)
This page was built for publication: A class of node based bottleneck improvement problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503225)