马尔可夫网络阻断与四色定理
Markovian Network Interdiction and the Four Color Theorem
摘要:
无反应马尔可夫逃逸者拦截问题(UME)要求在网络上最优地放置传感器,以检测一个或多个“逃逸者”的马尔可夫运动。先前已经证明,如果逃避者的数量是无界的,找到最佳的传感器布置是NP-难的。在这里,我们证明了这个问题是NP-难的,只有2个逃避者使用一个连接到着色的平面图。结果表明,近似算法是必要的,即使在应用程序中的逃避者的数量是小的。它仍然是一个开放的问题,以确定1-逃避者的情况下,或设计有效的算法的复杂性。
英文摘要:
The Unreactive Markovian Evader Interdiction Problem (UME) asks to optimally place sensors on a network to detect Markovian motion by one or more "evaders". It was previously proved that finding the optimal sensor placement is NP-hard if the number of evaders is unbounded. Here we show that the problem is NP-hard with just 2 evaders using a connection to coloring of planar graphs. The results suggest that approximation algorithms are needed even in applications where the number of evaders is small. It remains an open problem to determine the complexity of the 1-evader case or to devise efficient algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。