A simple $(2+\epsilon)$-approximation for knapsack interdiction

TL;DR

This paper introduces a simple and faster $(2+psilon)$-approximation algorithm for the knapsack interdiction problem, improving on existing PTAS in simplicity and speed.

Contribution

The authors present a simpler, more efficient approximation algorithm for knapsack interdiction that generalizes to higher dimensions with comparable approximation guarantees.

Findings

Achieves a $(2+psilon)$-approximation in polynomial time.

Algorithm is simpler and faster than existing PTAS.

Generalizes to $t$-dimensional knapsack interdiction with similar approximation ratio.

Abstract

In the knapsack interdiction problem, there are $n$ items, each with a non-negative profit, interdiction cost, and packing weight. There is also an interdiction budget and a capacity. The objective is to select a set of items to interdict (delete) subject to the budget which minimizes the maximum profit attainable by packing the remaining items subject to the capacity. We present a $(2+\epsilon)$-approximation running in $O(n^3\epsilon^{-1}\log(\epsilon^{-1}\log\sum_i p_i))$ time. Although a polynomial-time approximation scheme (PTAS) is already known for this problem, our algorithm is considerably simpler and faster. The approach also generalizes naturally to a $(1+t+\epsilon)$-approximation for $t$-dimensional knapsack interdiction with running time $O(n^{t+2}\epsilon^{-1}\log(\epsilon^{-1}\log\sum_i p_i))$.