Matrix interdiction problem
- Los Alamos National Laboratory
In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.
- Research Organization:
- Los Alamos National Laboratory (LANL)
- Sponsoring Organization:
- DOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 985896
- Report Number(s):
- LA-UR-10-00541; LA-UR-10-541
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal interdiction of unreactive Markovian evaders
Optimal interdiction of unreactive Markovian evaders
Interdiction of a Markovian evader
Conference
·
Wed Dec 31 23:00:00 EST 2008
·
OSTI ID:956355
Optimal interdiction of unreactive Markovian evaders
Conference
·
Mon Dec 31 23:00:00 EST 2007
·
OSTI ID:957745
Interdiction of a Markovian evader
Conference
·
Mon Dec 31 23:00:00 EST 2007
·
OSTI ID:960923