Abstract
In network interdiction problems, evaders (e.g., hostile agents or data packets) may be moving through a network towards targets and we wish to choose locations for sensors in order to intercept the evaders before they reach their destinations. The evaders might follow deterministic routes or Markov chains, or they may be reactive, i.e., able to change their routes in order to avoid sensors placed to detect them. The challenge in such problems is to choose sensor locations economically, balancing security gains with costs, including the inconvenience sensors inflict upon innocent travelers. We study the objectives of 1) maximizing the number of evaders captured when limited by a budget on sensing cost and 2) capturing all evaders as cheaply as possible.
We give optimal sensor placement algorithms for several classes of special graphs and hardness and approximation results for general graphs, including for deterministic or Markov chain-based and reactive or oblivious evaders. In a similar-sounding but fundamentally different problem setting posed by [7] where both evaders and innocent travelers are reactive, we again give optimal algorithms for special cases and hardness and approximation results on general graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters 1(4), 157–160 (1982)
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)
Even, S.: Graph Algorithms. Computer Science Press (1979)
Feige, U.: A threshold of ln for approximating set cover. J. ACM 45(4), 634–652 (1998)
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)
Glazer, K., Rubinstein, A.: A study in the pragmatics of persuasion: A game theoretical approach. Theoretical Economics 1, 395–410 (2006)
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
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)
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)
Corley, J.H.W., Chang, H.: Finding the n most vital nodes in a flow network. Management Science 21(3), 362–364 (1974)
Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: FOCS, pp. 671–680 (2009)
Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM Journal on Computing 4(1), 77–84 (1975)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
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)
McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Research Logistics Quarterly 17(3), 261–268 (1970)
Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods 4(2), 253–261 (1983)
Miettinen, P.: On the positive-negative partial set cover problem. Inf. Process. Lett. 108(4), 219–221 (2008)
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)
Peleg, D.: Approximation algorithms for the label-cover\(_{\mbox{max}}\) and red-blue set cover problems. J. Discrete Algorithms 5(1), 55–64 (2007)
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)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3(1), 103–128 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnson, M.P., Gutfraind, A. (2012). Evader Interdiction and Collateral Damage. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)