Optimal interdiction of unreactive Markovian evaders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5547 LNCS, Issue , 2009, Pages 102-116

  Gutfraind, Alexander ^a   Hagberg, Aric ^b   Pan, Feng ^c  

^a Cornell University ^*  (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; COST FORMULATION; COUNTER TERRORISM; EDGE-SETS; EVALUATION STRATEGIES; GREEDY ALGORITHMS; INCOMPLETE INFORMATION; INFECTIOUS DISEASE; LINEAR COMPLEXITY; MARKOVIAN; MILITARY LOGISTICS; NETWORK EDGES; NETWORK INTERDICTION; NP-HARD; OPTIMAL SOLUTIONS; ORDERS OF MAGNITUDE; PLANNING TIME; SUBMODULAR; SUBMODULARITY; WEIGHTED NETWORKS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; DISEASE CONTROL; MARKOV PROCESSES;

SET THEORY;

EID: 69849107162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01929-6_9     Document Type: Conference Paper

References (17)

1. Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Oper. Res. Lett. 1(4), 157-160 (1982)
2. McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Research Logistics Quarterly 17(3), 261-268 (1970)
3. Ghare, P.M., Montgomery, D.C., Turner, W.C.: Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly 18(1), 37 (1971)
4. Pourbohloul, B., Meyers, L., Skowronski, D., Krajden, M., Patrick, D., Brunham, R.: Modeling control strategies of respiratory pathogens. Emerg. Infect. Dis. 11(8), 1246-1256 (2005)
5. Farley, J.D.: Breaking Al Qaeda cells: A mathematical analysis of counterterrorism operations (a guide for risk assessment and decision making). Studies in Conflict and Terrorism 26, 399-411 (2003)
6. Pan, F., Charlton, W., Morton, D.P.: Interdicting smuggled nuclear material. In: Woodruff, D. (ed.) Network Interdiction and Stochastic Integer Programming, pp. 1-19. Kluwer Academic Publishers, Boston (2003)
7. Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Oper. Res. Lett. 8(2), 73-76 (1989)
8. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report, University of Maryland, College Park, MD, USA (1995)
9. Boros, E., Borys, K., Gurevich, V.: Inapproximability bounds for shortest-path network inte-diction problems. Technical report, Rutgers University, Piscataway, NJ, USA (2006)
10. Gutfraind, A., Hagberg, A., Izraelevitz, D., Pan, F.: Interdicting a Markovian evader (preprint) (2009)
11. Grinstead, C.M., Snell, J.L.: Introduction to Probability. Second revised edn. American Mathematical Society, USA (July 1997)
12. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum, New York (1972)
13. Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions-I. Mathematical Programming 14, 265-294 (1978)
14. Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Information Processing Letters 70(1), 39-45 (1999)
15. Krause, A., Guestrin, C.: A note on the budgeted maximization on submodular functions. Technical report, Carnegie Mellon University, CMU-CALD-05-103 (2005)
16. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD 2007: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 420-429. ACM, New York (2007)
17. Bradonjić, M., Kong, J.S.: Wireless ad hoc networks with tunable topology. In: Forty-Fifth Annual Allerton Conference, UIUC, Illinois, USA, pp. 1170-1177 (2007)