scientific article; zbMATH DE number 871953
From MaRDI portal
Publication:4875228
Recommendations
- Increasing the Weight of Minimum Spanning Trees
- A linear programming approach to increasing the weight of all minimum spanning trees
- Upgrading min-max spanning tree problem under various cost functions
- The most vital edges in the minimum spanning tree problem
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
Cited in
(32)- Minimum cost edge blocker clique problem
- On supervalid inequalities for binary interdiction games
- A linear programming approach to increasing the weight of all minimum spanning trees
- Increasing the Weight of Minimum Spanning Trees
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry
- Modifying edges of a network to obtain short subgraphs
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted l₁ norm
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Edge capacity augmentation problem on spanning trees in networks
- Complexity of most vital nodes for independent set in graphs related to tree structures
- Minimum edge blocker dominating set problem
- Complexity of determining the most vital elements for the p-median and p-center location problems
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- The most vital nodes with respect to independent set and vertex cover
- Blockers for the stability number and the chromatic number
- Improving spanning trees by upgrading nodes
- Matching interdiction
- Incremental network design with minimum spanning trees
- Critical edges for the assignment problem: complexity and exact resolution
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- On budget-constrained flow improvement.
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- b-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets
- Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
- On the optimum capacity of capacity expansion problems
- Efficient algorithms for robustness in resource allocation and scheduling problems
- Stability of solutions in problems of computational geometry
- Modifying networks to obtain low cost trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875228)
