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), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 985896
- Report Number(s):
- LA-UR-10-00541; LA-UR-10-541; ISSN 1563-5147; TRN: US201017%%74
- Resource Relation:
- Journal Volume: 2010; Conference: CPIAOR 2010 ; June 14, 2010 ; Bologna, Italy
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel approximate algorithms for combinatorially hard problems
Optimal interdiction of unreactive Markovian evaders