.png){kind=icon}
返回
Evader interdiction: algorithms, complexity and collateral damage
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-013-1372-x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In network interdiction problems, evaders (e.g., hostile agents or data packets) are moving through a network toward targets and we wish to choose locations for sensors in order to intercept the evaders. 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 the sensors. The challenge in such problems is to choose sensor locations economically, balancing interdiction 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 algorithms for optimal sensor placement in several classes of special graphs and hardness and approximation results for general graphs, including evaders who are deterministic, Markov chain-based, reactive and unreactive. A similar-sounding but fundamentally different problem setting was posed by Glazer and Rubinstein where both evaders and innocent travelers are reactive. We again give optimal algorithms for special cases and hardness and approximation results on general graphs.
Keyword:
Network interdiction
Bridge policy
Submodular set cover
Markov chain
Minimal cut
Four color theorem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Identification of Ehrlichia chaffeensis morulae in cerebrospinal fluid mononuclear cells脑脊液单个核细胞中查菲埃里希体的鉴定
OAAI
OAAI分享收藏Fight Islamophobia in Europe? Less Islam and Muslims and More Citizenship!在欧洲反对伊斯兰恐惧症？减少伊斯兰教和穆斯林，增加公民身份！
PREAI
分享收藏Cats, Crocodiles, Cattle, and More: Initial Steps Toward Establishing a Chronology of Ancient Egyptian Animal Mummies.png)
Radiocarbon
RadiocarbonIF0
PREAI
分享收藏
查看更多内容