Covering users by a connected swarm efficiently

DOI10.1007/978-3-030-62401-9_3zbMath1477.68040OpenAlexW3095613880MaRDI QIDQ2037819

Kiril Danilchenko, Michael Segal, Zeev Nutov

Publication date: 8 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-62401-9_3

zbMATH Keywords

approximation algorithmdynamic data structuretree partitionbudgeted covering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)

This page was built for publication: Covering users by a connected swarm efficiently