论文信息 - A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors

A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors

Given an arrangement A of n sensors and two points s and t in the plane, the barrier resilience of A with respect to s and t is the minimum number of sensors whose removal permits a path from s to ...

David G. Kirkpatrick | Boting Yang | Sandra Zilles

[1] Kurt Mehlhorn,et al. Certifying algorithms , 2011, Comput. Sci. Rev..

[2] Anish Arora,et al. Barrier coverage with wireless sensors , 2007, Wirel. Networks.

[3] Sergey Bereg,et al. Approximating Barrier Resilience in Wireless Sensor Networks , 2009, ALGOSENSORS.

[4] David G. Kirkpatrick,et al. On Barrier Resilience of Sensor Networks , 2011, ALGOSENSORS.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Leonidas J. Guibas,et al. Ray shooting in polygons using geodesic triangulations , 1991, Algorithmica.

[7] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[8] Andrea E. F. Clementi,et al. On the Complexity of Approximating Colored-Graph Problems , 1999, COCOON.