Complexity of barrier coverage with relocatable sensors in the plane
Publication:2344757
DOI10.1016/j.tcs.2015.02.006zbMath1312.68212OpenAlexW2180483632MaRDI QIDQ2344757
Stefan Dobrev, Lata Narayanan, Danny Krizanc, Konstantinos Georgiou, Jaroslav Opatrny, Evangelos Kranakis, Stephane Durocher, Jorge Urrutia, Mohsen Eftekhari, Sunil M. Shende
Publication date: 18 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.006
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (14)
Cites Work
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
- Optimal movement of mobile sensors for barrier coverage of a planar region
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- New Algorithms for Barrier Coverage with Mobile Sensors
- Complexity of automaton identification from given data
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane
- Distributed algorithms for barrier coverage using relocatable sensors
- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
This page was built for publication: Complexity of barrier coverage with relocatable sensors in the plane