Minimizing the aggregate movements for interval coverage

DOI10.1007/s00453-016-0153-8zbMath1360.68868arXiv1412.2300OpenAlexW1520878526MaRDI QIDQ527411

Haitao Wang, Aaron M. Andrews

Publication date: 11 May 2017

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

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

zbMATH Keywords

algorithmsdata structurescomputational geometryinterval coveragemobile sensorsbarrier coveragemin-sum

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement ⋮ Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane ⋮ Improved PTASs for convex barrier coverage ⋮ Minimizing the aggregate movements for interval coverage ⋮ Minimizing the total cost of barrier coverage in a linear domain ⋮ Algorithms for covering multiple barriers ⋮ Minimizing the Maximum Moving Cost of Interval Coverage ⋮ Weak coverage of a rectangular barrier ⋮ Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements

Cites Work

• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Minimizing the aggregate movements for interval coverage
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Optimal point movement for covering circular regions
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• New Algorithms for Barrier Coverage with Mobile Sensors

This page was built for publication: Minimizing the aggregate movements for interval coverage