Set it and forget it: approximating the set once strip cover problem

DOI10.1007/s00453-016-0198-8zbMath1372.68043arXiv1204.1082OpenAlexW2101613039MaRDI QIDQ2408917

Ben Baumer, Dror Rawitz, Amotz Bar-Noy

Publication date: 10 October 2017

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

wireless sensor networksnetwork lifetimebarrier coveragestrip cover

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (7)

Maximizing Barrier Coverage Lifetime with Static Sensors ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Changing of the guards: strip cover with duty cycling ⋮ ``Green barrier coverage with mobile sensors ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Average case network lifetime on an interval with adjustable sensing ranges ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• Decomposition of multiple coverings into more parts
• Optimally decomposing coverings with translates of a convex polygon
• Decomposition of multiple coverings into many parts
• Covering the plane with convex polygons
• Connecting a set of circles with minimum sum of radii
• Average case network lifetime on an interval with adjustable sensing ranges
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• Changing of the Guards: Strip Cover with Duty Cycling
• Unnamed Item

This page was built for publication: Set it and forget it: approximating the set once strip cover problem