Parametric matroid interdiction (Q6122085)

scientific article; zbMATH DE number 7825283

Language	Label	Description	Also known as
English	Parametric matroid interdiction	scientific article; zbMATH DE number 7825283

Statements

instance of

scholarly article

0 references

title

Parametric matroid interdiction (English)

0 references

arXiv ID

2310.05147

0 references

DOI

10.1016/j.disopt.2024.100823

0 references

0 references

0 references

0 references

0 references

Discrete Optimization

0 references

publication date

27 March 2024

0 references

full work available at URL

https://arxiv.org/abs/2310.05147

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

interdiction

0 references

parametric optimization

0 references

matroid

0 references

minimum spanning tree

0 references

MaRDI profile type

MaRDI publication profile

0 references

OpenAlex ID

W4391241650

0 references

cites work

An Introduction to Matroid Theory

0 references

Q4111952

0 references

Q5390304

0 references

Q3997906

0 references

On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory

0 references

Optimal Locally Repairable Codes and Connections to Matroid Theory

0 references

Complexity of some parametric integer and network programming problems

0 references

Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh

0 references

Stochastic Shortest Paths Via Quasi-convex Maximization

0 references

A fast parametric assignment algorithm with applications in max-algebra

0 references

Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

0 references

An approximation algorithm for a general class of parametric optimization problems

0 references

Generalization of a theorem on the parametric maximum flow problem

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

Q4228485

0 references

A note on the parametric maximum flow problem and some related reoptimization issues

0 references

Using sparsification for parametric minimum spanning tree problems

0 references

A survey of network interdiction models and algorithms

0 references

Network interdiction with asymmetric cost uncertainty

0 references

Improved Algorithms for MST and Metric-TSP Interdiction

0 references

Q3455036

0 references

Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives

0 references

Algorithms for measuring perturbality in matroid optimization

0 references

Finding the most vital edge with respect to minimum spanning tree in weighted graphs

0 references

Efficient algorithms for finding the most vital edge of a minimum spanning tree

0 references

Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup>

0 references

The most vital edges in the minimum spanning tree problem

0 references

Increasing the Weight of Minimum Spanning Trees

0 references

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

0 references

Finding the \(k\) most vital edges with respect to minimum spanning tree

0 references

Finding the k most vital edges in the minimum spanning tree problem

0 references

Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)

0 references

Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem

0 references

Parameterized Complexity of Edge Interdiction Problems

0 references

Integer Programming Formulations for Minimum Spanning Tree Interdiction

0 references

The fuzzy shortest path problem and its most vital arcs

0 references

Stochastic Network Interdiction

0 references

The single most vital arc in the most economical path problem -- a parametric analysis

0 references

Interdicting the activities of a linear program -- a parametric analysis

0 references

Improved bounds for planar \(k\)-sets and related problems

0 references

Q4234116

0 references

Q4325546

0 references

Finding the upper envelope of n line segments in O(n log n) time

0 references

Maintaining bridge-connected and biconnected components on-line

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6122085