Upgrading bottleneck constrained forests
From MaRDI portal
Publication:5928872
DOI10.1016/S0166-218X(00)00222-5zbMath0971.68007OpenAlexW1481221742MaRDI QIDQ5928872
Hans-Christoph Wirth, Hartmut Noltemeier, S. S. Ravi, Sven O. Krumke, Madhav V. Marathe
Publication date: 30 October 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00222-5
Related Items
Improving multicut in directed trees by upgrading nodes, Optimizing cost flows by edge cost and capacity upgrade, Weight reduction problems with certain bottleneck objectives., Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies, A class of node based bottleneck improvement problems
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the location of minisum facilities through network modification
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Network upgrading problems
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- The network inhibition problem