Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region

DOI10.1007/978-3-540-85097-7_10zbMath1168.68589OpenAlexW1535001420MaRDI QIDQ5505648

Qiaosheng Shi, B. Burmester, Binay K. Bhattacharya, Yuzhuang Hu, Andreas Wiese, Evangelos Kranakis

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_10

Mathematics Subject Classification ID

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

Related Items (1)

Complexity of barrier coverage with relocatable sensors in the plane

Cites Work

• Disjoint circuits of prescribed homotopies in a graph on a compact surface
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region