Increasing the Weight of Minimum Spanning Trees
From MaRDI portal
Publication:4935308
DOI10.1006/jagm.1999.1026zbMath0956.68113OpenAlexW2047684506MaRDI 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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (30)
Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ Upgrading \(p\)-median problem on a path ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ On designing networks resilient to clique blockers ⋮ Parametric matroid interdiction ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ A linear programming approach to increasing the weight of all minimum spanning trees ⋮ Cut problems in graphs with a budget constraint ⋮ Reverse 2-median problem on trees ⋮ Blocking optimal arborescences ⋮ Blocking unions of arborescences ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Connectivity interdiction ⋮ Modifying edges of a network to obtain short subgraphs ⋮ Up- and downgrading the 1-center in a network ⋮ Multilevel Approaches for the Critical Node Problem ⋮ The continuous maximum capacity path interdiction problem
This page was built for publication: Increasing the Weight of Minimum Spanning Trees
