A Note on Interdiction of Linear Minimization Problems

Abstract

Motivated by the FPTAS for connectivity interdiction of Huang et al. (IPCO'24), we isolate the part of the argument that does not use cuts. The setting is a minimization problem over a feasible-set family $\mathcal{F}$ with a linear objective $w(S)={\sum }_{e\in S}w(e)$. After dualizing the interdiction budget, deletion can be absorbed into truncated weights $w_{\hat{I}}»(e)=\min \{w(e),\hat{I}»c(e)\}$. At an optimal Lagrange multiplier $\hat{I}{»}^{\ast }$, the unknown optimal interdiction witness is a strict $2$-approximate minimizer of the reweighted problem. Thus an exact algorithm can be obtained whenever one can optimize $w_{\hat{I}{»}^{\ast }}$ over $\mathcal{F}$, enumerate all its $2$-approximate minimizers, and solve the remaining knapsack problem.