Showing 2021Show all
2 papers · 1 filter
cs.DC2021
The Max-Line-Formation Problem
Jannik Castenow, Thorsten Götte, Till Knollmann +1
We consider n robots with limited visibility: each robot can observe other robots only up to a constant distance denoted as the viewing range. The robots operate in discrete rounds…
cs.DC2021
Beep-And-Sleep: Message and Energy Efficient Set Cover
Thorsten Götte, Christina Kolb, Christian Scheideler +1
We observe message-efficient distributed algorithms for the Set Cover problem. Given a ground set of elements and subsets of , we aim to find the minimal number of t…