Bottleneck spanning tree interdiction problem with fixed and linear costs
From MaRDI portal
Cites work
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A data structure for dynamic trees
- A survey of network interdiction models and algorithms
- An O(1)-approximation for minimum spanning tree interdiction
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Evader interdiction: algorithms, complexity and collateral damage
- Fast and simple fully-dynamic cut tree construction
- Finding the k most vital edges with respect to minimum spanning tree
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- Handbook of game theory and industrial organization. Volume I: Theory
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Matching interdiction
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Network flows. Theory, algorithms, and applications.
- Partial inverse min-max spanning tree problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- The Min-Max Spanning Tree Problem and some extensions
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Two-Person Zero-Sum Games for Network Interdiction
This page was built for publication: Bottleneck spanning tree interdiction problem with fixed and linear costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963963)
