Upgrading bottleneck constrained forests

DOI10.1016/S0166-218X(00)00222-5MaRDI QIDQ5928872zbMATH OpenOpenAlexFDO

Authors Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, H.-C. Wirth

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

zbMATH Keywords

bottleneck constrained network upgrading problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1262800
• Approximation algorithms for certain network improvement problems
• Improving spanning trees by upgrading nodes
• Improving spanning trees by upgrading nodes
• A class of node based bottleneck improvement problems

Cites work

• A General Approximation Technique for Constrained Forest Problems
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• scientific article; zbMATH DE number 1003253 (Why is no real title available?)
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Improving the location of minisum facilities through network modification
• Network upgrading problems
• The network inhibition problem

Cited in

(11)

• Weight reduction problems with certain bottleneck objectives.
• Improving spanning trees by upgrading nodes
• A class of node based bottleneck improvement problems
• To improve the communication delay by upgrading nodes in a continuous version
• Improving multicut in directed trees by upgrading nodes
• scientific article; zbMATH DE number 1262800 (Why is no real title available?)
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Algorithms and Computation
• The constrained Bottleneck spanning tree problem with upgrades
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
• Optimizing cost flows by edge cost and capacity upgrade

This page was built for publication: Upgrading bottleneck constrained forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928872)