Covering users by a connected swarm efficiently
type: Item
instance of: scholarly article
title: Covering users by a connected swarm efficiently
zbMATH Open document ID: 1477.68040
DOI: 10.1007/978-3-030-62401-9_3
author: Kiril Danilchenko
author: Michael Segal
author: Zeev Nutov
publication date: 2021-07-08T00:00:00Z
Mathematics Subject Classification ID: 68M18
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7369824
zbMATH Keywords: budgeted covering
zbMATH Keywords: approximation algorithm
zbMATH Keywords: dynamic data structure
zbMATH Keywords: tree partition
MaRDI profile type: Publication
full work available at URL: 978-3-030-62401-9 3
OpenAlex ID: W3095613880
description: scientific article; zbMATH DE number 7369824