Improving Minimum Cost Spanning Trees by Upgrading Nodes

DOI10.1006/jagm.1999.1021zbMath0937.68095OpenAlexW1975646422MaRDI QIDQ4939607

S. S. Ravi, R. Ravi, Ravi Sundaram, Hans-Christoph Wirth, Madhav V. Marathe, Sven O. Krumke, Hartmut Noltemeier

Publication date: 6 February 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc706888/

zbMATH Keywords

budget constrained network upgrading problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Upgrading nodes in tree-shaped hub location ⋮ Improving multicut in directed trees by upgrading nodes ⋮ Lagrangian and branch-and-cut approaches for upgrading spanning tree problems ⋮ The capacity expansion path problem in networks ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ Upgrading bottleneck constrained forests ⋮ Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies ⋮ A class of node based bottleneck improvement problems ⋮ Modifying edges of a network to obtain short subgraphs ⋮ On budget-constrained flow improvement.

This page was built for publication: Improving Minimum Cost Spanning Trees by Upgrading Nodes