Parametric matroid interdiction
From MaRDI portal
Publication:6122085
DOI10.1016/j.disopt.2024.100823arXiv2310.05147OpenAlexW4391241650MaRDI QIDQ6122085
Luca E. Schäfer, Stefan Ruzika, Oliver Bachtler, Nils Hausbrandt
Publication date: 27 March 2024
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.05147
Mathematical programming (90Cxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Finding the upper envelope of n line segments in O(n log n) time
- 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
- Maintaining bridge-connected and biconnected components on-line
- Generalization of a theorem on the parametric maximum flow problem
- The most vital edges in the minimum spanning tree problem
- Algorithms for measuring perturbality in matroid optimization
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- The fuzzy shortest path problem and its most vital arcs
- The single most vital arc in the most economical path problem -- a parametric analysis
- Improved bounds for planar \(k\)-sets and related problems
- Interdicting the activities of a linear program -- a parametric analysis
- 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
- An approximation algorithm for a general class of parametric optimization problems
- Network interdiction with asymmetric cost uncertainty
- A survey of network interdiction models and algorithms
- A note on the parametric maximum flow problem and some related reoptimization issues
- Stochastic Network Interdiction
- Parameterized Complexity of Edge Interdiction Problems
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- A fast parametric assignment algorithm with applications in max-algebra
- Complexity of some parametric integer and network programming problems
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗
- A Fast Parametric Maximum Flow Algorithm and Applications
- Increasing the Weight of Minimum Spanning Trees
- Using sparsification for parametric minimum spanning tree problems
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Improved Algorithms for MST and Metric-TSP Interdiction
- An Introduction to Matroid Theory
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
This page was built for publication: Parametric matroid interdiction
