Network interdiction with budget constraints

Journal Article · Thu Jan 01 04:00:00 EST 2009

OSTI ID:956539

Santhi, Nankakishore ^[1]; Pan, Feng ^[1]

---

1. Los Alamos National Laboratory

Several scenarios exist in the modern interconnected world which call for efficient network interdiction algorithms. Applications are varied, including computer network security, prevention of spreading of Internet worms, policing international smuggling networks, controlling spread of diseases and optimizing the operation of large public energy grids. In this paper we consider some natural network optimization questions related to the budget constrained interdiction problem over general graphs. Many of these questions turn out to be computationally hard to tackle. We present a particularly interesting practical form of the interdiction question which we show to be computationally tractable. A polynomial time algorithm is then presented for this problem.

• Research Organization: Los Alamos National Laboratory (LANL)
• Sponsoring Organization: DOE
• DOE Contract Number: AC52-06NA25396
• OSTI ID: 956539
• Report Number(s): LA-UR-09-00377; LA-UR-09-377
• Country of Publication: United States
• Language: English

Related Subjects

42 ENGINEERING
ALGORITHMS
BUDGETS
COMPUTER NETWORKS
DISEASES
ENERGY
GRIDS
INTERNET
OPERATION
OPTIMIZATION
POLYNOMIALS
SECURITY