On the complexity of and algorithms for min-max target coverage on a line boundary

DOI10.1007/978-3-030-14812-6_19MaRDI QIDQ2327482zbMATH OpenOpenAlexFDO

Authors Peihuang Huang, Longkun Guo, Wenxing Zhu

Publication date 15 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-14812-6_19

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
• ``Green barrier coverage with mobile sensors
• Barrier coverage with non-uniform lengths to minimize aggregate movements

This page was built for publication: On the complexity of and algorithms for min-max target coverage on a line boundary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327482)