Optimal Distributed Covering Algorithms

DOI10.1145/3293611.3331577OpenAlexW2963424691WikidataQ130852435 ScholiaQ130852435MaRDI QIDQ5145187

Gregory Schwartzman, Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.09377

zbMATH Keywords

graph algorithmsdistributed computingvertex coverset coverprimal dual

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Parameterized analysis and crossing minimization problems ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Beep-and-sleep: message and energy efficient set cover

This page was built for publication: Optimal Distributed Covering Algorithms