Increasing the Weight of Minimum Spanning Trees
From MaRDI portal
Publication:4935308
DOI10.1006/jagm.1999.1026zbMath0956.68113MaRDI QIDQ4935308
Roberto Solis-Oba, Greg N. Frederickson
Publication date: 19 March 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1026
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
Related Items
Reverse 2-median problem on trees, Up- and downgrading the 1-center in a network, Modifying edges of a network to obtain short subgraphs, Weight reduction problems with certain bottleneck objectives., A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, Cut problems in graphs with a budget constraint, Bottleneck Capacity Expansion Problems with General Budget Constraints, A linear programming approach to increasing the weight of all minimum spanning trees