Recommendations
Cites work
- A fast parametric assignment algorithm with applications in max-algebra
- A Fast Parametric Maximum Flow Algorithm and Applications
- A note on the parametric maximum flow problem and some related reoptimization issues
- A survey of network interdiction models and algorithms
- Algorithms for measuring perturbality in matroid optimization
- An approximation algorithm for a general class of parametric optimization problems
- An Introduction to Matroid Theory
- Complexity of some parametric integer and network programming problems
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Finding the k most vital edges with respect to minimum spanning tree
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
- Finding the k most vital edges in the minimum spanning tree problem
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- Finding the upper envelope of n line segments in O(n log n) time
- Generalization of a theorem on the parametric maximum flow problem
- scientific article; zbMATH DE number 6515828 (Why is no real title available?)
- scientific article; zbMATH DE number 49099 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1256749 (Why is no real title available?)
- scientific article; zbMATH DE number 1263243 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Improved Algorithms for MST and Metric-TSP Interdiction
- Improved bounds for planar k-sets and related problems
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗
- Increasing the Weight of Minimum Spanning Trees
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Interdicting the activities of a linear program -- a parametric analysis
- Maintaining bridge-connected and biconnected components on-line
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Network interdiction with asymmetric cost uncertainty
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Parameterized Complexity of Edge Interdiction Problems
- Stochastic network interdiction
- Stochastic Shortest Paths Via Quasi-convex Maximization
- The fuzzy shortest path problem and its most vital arcs
- The most vital edges in the minimum spanning tree problem
- The single most vital arc in the most economical path problem -- a parametric analysis
- Using sparsification for parametric minimum spanning tree problems
Cited in
(3)
This page was built for publication: Parametric matroid interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122085)
