A linear programming approach to increasing the weight of all minimum spanning trees
From MaRDI portal
Publication:3548723
Recommendations
Cites work
- A faster algorithm for computing the strength of a network
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Computing the Strength of a Graph
- Edge-Disjoint Spanning Trees of Finite Graphs
- Increasing the Weight of Minimum Spanning Trees
- Network reinforcement
- New primal and dual matching heuristics
- On the Problem of Decomposing a Graph into n Connected Factors
- Optimal attack and reinforcement of a network
- Packing Spanning Trees
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Separating from the dominant of the spanning tree polytope
Cited in
(5)- Fast approximation of matroid packing and covering
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Increasing the Weight of Minimum Spanning Trees
- Upgrading min-max spanning tree problem under various cost functions
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
This page was built for publication: A linear programming approach to increasing the weight of all minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548723)