Increasing the Weight of Minimum Spanning Trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 871953
- A linear programming approach to increasing the weight of all minimum spanning trees
- The most vital edges in the minimum spanning tree problem
- Incremental minimum spanning tree algorithms
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Cited in
(42)- Up- and downgrading the 1-center in a network
- The most vital edges in the minimum spanning tree problem
- An O(m n) algorithm for the max+sum spanning tree problem
- Modifying edges of a network to obtain short subgraphs
- Weight reduction problems with certain bottleneck objectives.
- Exact algorithms for the minimum cost vertex blocker clique problem
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Blocking unions of arborescences
- Connectivity interdiction
- The continuous maximum capacity path interdiction 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
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- Recoverable robust spanning tree problem under interval uncertainty representations
- Cut problems in graphs with a budget constraint
- Bottleneck capacity expansion problems with general budget constraints
- Incremental network design with minimum spanning trees
- A linear programming approach to increasing the weight of all minimum spanning trees
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Improving spanning trees by upgrading nodes
- Detecting critical node structures on graphs: a mathematical programming approach
- scientific article; zbMATH DE number 871953 (Why is no real title available?)
- Edge capacity augmentation problem on spanning trees in networks
- Multilevel approaches for the critical node problem
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Improved Algorithms for MST and Metric-TSP Interdiction
- Incremental minimum spanning tree algorithms
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Upgrading edges in the graphical TSP
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- On designing networks resilient to clique blockers
- Parametric matroid interdiction
- Vital edges for (s,t)-mincut: efficient algorithms, compact structures, \& optimal sensitivity oracles
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
- Some upgrading problems on networks related to eccentricity concept
- The quickest root-leaf interdiction problem on tree networks
- Optimal cost augmentation and interdiction problem for the minimum spanning tree
- Upgrading \(p\)-median problem on a path
- Reverse 2-median problem on trees
This page was built for publication: Increasing the Weight of Minimum Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935308)
