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 $U$ of $n$ elements and $m$ subsets of $U$, we aim to find the minimal number of t…