Publication:2300721

DOI10.1007/s00453-019-00611-7zbMath1435.68342arXiv1701.07294OpenAlexW2952076588MaRDI QIDQ2300721

Lata Narayanan, Ladislav Stacho, Evangelos Kranakis, Manuel Lafond, Danny Krizanc, Ján Maňuch, Jaroslav Opatrny, Stefan Dobrev, Sunil M. Shende

Publication date: 28 February 2020

Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.07294

zbMATH Keywords

polynomial algorithmNP-complete problemmobile sensorsbarrier coverageoptimizing sensor movements

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 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) Wireless sensor networks as related to computer science (68M18)

Related Items (2)

Minimizing the total cost of barrier coverage in a linear domain ⋮ Weak coverage of a rectangular barrier

Cites Work

• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Distributed algorithms for barrier coverage using relocatable sensors
• Minimizing the aggregate movements for interval coverage
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Weak coverage of a rectangular barrier
• Complexity of barrier coverage with relocatable sensors in the plane
• A study on the weak barrier coverage problem in wireless sensor networks
• Distributed Barrier Coverage with Relocatable Sensors
• Unnamed Item

This page was built for publication: Weak coverage of a rectangular barrier