New Algorithms for Barrier Coverage with Mobile Sensors

DOI10.1007/978-3-642-14553-7_31zbMath1288.68234OpenAlexW1603500658MaRDI QIDQ3587364

Gangshan Wu, Xue-Hou Tan

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_31

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Barrier Coverage with Uniform Radii in 2D ⋮ A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement ⋮ Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane ⋮ Minimizing the aggregate movements for interval coverage ⋮ ``Green barrier coverage with mobile sensors ⋮ Complexity of barrier coverage with relocatable sensors in the plane ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors ⋮ Optimal point movement for covering circular regions

This page was built for publication: New Algorithms for Barrier Coverage with Mobile Sensors