Improving Minimum Cost Spanning Trees by Upgrading Nodes
From MaRDI portal
Publication:4939607
DOI10.1006/jagm.1999.1021zbMath0937.68095MaRDI 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/
68R10: Graph theory (including graph drawing) in computer science
Related Items
Upgrading bottleneck constrained forests, The capacity expansion path problem in networks, On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph, Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies, Modifying edges of a network to obtain short subgraphs, A class of node based bottleneck improvement problems, On budget-constrained flow improvement., Improving multicut in directed trees by upgrading nodes