Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane

DOI10.1016/j.tcs.2022.10.046OpenAlexW4308434506MaRDI QIDQ2680855

Chunlin Hao, Longkun Guo, Wenjie Zou, Lei Liu

Publication date: 4 January 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.046

zbMATH Keywords

barrier coveragemobile sensorauxiliary graphsink stationgeometrically tangent segments

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Minimizing the aggregate movements for interval coverage
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Complexity of barrier coverage with relocatable sensors in the plane
• Optimal point movement for covering circular regions
• Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line
• Coverage problems in sensor networks
• New Algorithms for Barrier Coverage with Mobile Sensors
• Barrier Coverage with Uniform Radii in 2D
• Improved PTASs for convex barrier coverage
• Barrier coverage problem in 2D

This page was built for publication: Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane