Evader interdiction and collateral damage

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

Volumn 7111 LNCS, Issue , 2012, Pages 86-100

  Johnson, Matthew P ^a   Gutfraind, Alexander ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RESULTS; COLLATERAL DAMAGE; DATA PACKET; GENERAL GRAPH; NETWORK INTERDICTION PROBLEMS; OPTIMAL ALGORITHM; OPTIMAL SENSOR PLACEMENT; SENSOR LOCATION;

AUTONOMOUS AGENTS; HARDNESS; MARKOV PROCESSES; MOBILE AGENTS; OPTIMIZATION; SENSORS; WIRELESS AD HOC NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 84863407310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28209-6_8     Document Type: Conference Paper

References (22)

1. 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)
2. Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters 1(4), 157-160 (1982)
3. Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms 4(3) (2008)
4. Even, S.: Graph Algorithms. Computer Science Press (1979)
5. Feige, U.: A threshold of ln for approximating set cover. J. ACM 45(4), 634-652 (1998)
6. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Computing 1(2), 180-187 (1972)
7. Glazer, K., Rubinstein, A.: A study in the pragmatics of persuasion: A game theoretical approach. Theoretical Economics 1, 395-410 (2006)
8. Gutfraind, A., Ahmadizadeh, K.: Markovian Network Interdiction and the Four Color Theorem. Review with SIAM J. Discrete Math. (2009), http://arxiv.org/abs/0911.4322
9. Gutfraind, A., Hagberg, A., Izraelevitz, D., Pan, F.: Interdiction of a Markovian Evader. In: Dell, R., Wood, K. (eds.) Proc. INFORMS Computing Society Conference (January 2011)
10. Gutfraind, A., Hagberg, A., Pan, F.: Optimal Interdiction of Unreactive Markovian Evaders. In: van Hoeve,W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 102-116. Springer, Heidelberg (2009)
11. Corley, J.H.W., Chang, H.: Finding the n most vital nodes in a flow network. Management Science 21(3), 362-364 (1974)
12. Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: FOCS, pp. 671-680 (2009)
13. Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM Journal on Computing 4(1), 77-84 (1975)
14. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 - ε. J. Comput. Syst. Sci. 74(3), 335-349 (2008)
15. Koufogiannakis, C., Young, N.E.: Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. In: Albers, S., Marchetti- Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 634-652. Springer, Heidelberg (2009)
16. McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Research Logistics Quarterly 17(3), 261-268 (1970)
17. Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods 4(2), 253-261 (1983)
18. Miettinen, P.: On the positive-negative partial set cover problem. Inf. Process. Lett. 108(4), 219-221 (2008)
19. Pan, F., Charlton, W.S., 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)
20. Peleg, D.: Approximation algorithms for the label-covermax and red-blue set cover problems. J. Discrete Algorithms 5(1), 55-64 (2007)
21. Ratliff, H.D., Sicilia, G.T., Lubore, S.H.: Finding the n most vital links in flow networks. Management Science 21(5), 531-539 (1975)
22. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3(1), 103-128 (2007)