Evader Interdiction and Collateral Damage
- Los Alamos National Laboratory
In network interdiction problems, evaders (hostile agents or data packets) are moving through a network towards their targets and we wish to choose sensor placement locations in order to intercept them before they reach their destinations. Sensor locations should be chosen economically, balancing security gains with cost, including the inconvenience sensors inflict upon innocent travelers. We give optimal sensor allocation algorithms for several classes of special graphs and hardness and optimal approximation results for general graphs, including for deterministic or Markov chain-based and oblivious or reactive evaders. In a similar-sounding but much different problem setting posed by [10] where the innocent travelers can also be reactive, we again give optimal algorithms for special cases and hardness and (essentially) optimal approximation results on general graphs.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- DOE/LANL
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 1012379
- Report Number(s):
- LA-UR-11-10123; TRN: US201109%%812
- Resource Relation:
- Conference: Structural Information and Communication Complexity (SIROCCO) 2011 ; 2011-06-26 - 2011-06-29 ; Gdansk, Poland
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal interdiction of unreactive Markovian evaders
Interdiction of a Markovian evader