Optimal Distributed Covering Algorithms

DOI10.1145/3293611.3331577OpenAlexW2963424691WikidataQ130852435 ScholiaQ130852435MaRDI QIDQ5145187FDOQ5145187

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

distributed computinggraph algorithmsset coververtex coverprimal dual

Mathematics Subject Classification ID

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

Cited In (5)

• Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
• Beep-and-sleep: message and energy efficient set cover
• The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
• Parameterized analysis and crossing minimization problems
• Title not available (Why is that?)

This page was built for publication: Optimal Distributed Covering Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145187)