Complexity of Barrier Coverage with Relocatable Sensors in the Plane
From MaRDI portal
Publication:4924647
DOI10.1007/978-3-642-38233-8_15zbMath1382.68104MaRDI QIDQ4924647
Konstantinos Georgiou, Jaroslav Opatrny, Stephane Durocher, Jorge Urrutia, Stefan Dobrev, Mohsen Eftekhari, Sunil M. Shende, Lata Narayanan, Danny Krizanc, Evangelos Kranakis
Publication date: 7 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_15
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Complexity of barrier coverage with relocatable sensors in the plane, “Green” Barrier Coverage with Mobile Sensors