Brief Announcement: Optimal Distributed Covering Algorithms

Ran Ben Basat, Guy Even, Ken Ichi Kawarabayashi, Gregory Schwartzman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f . This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded by f . The approximation factor of our algorithm is (f +ϵ). Let δ denote the maximum degree in the hypergraph. Our algorithm runs in the congest model and requiresO(log δ/log log δ) rounds, for constants ϵ ϵ (0, 1] and f ϵ ℕ+. This is the first distributed algorithm for this problem whose running time does not depend on the vertex weights nor the number of vertices. Thus adding another member to the exclusive family of provably optimal distributed algorithms. For constant values of f and ϵ, our algorithm improves over the (f + ϵ)-approximation algorithm of [16] whose running time is O(log δ + logW), whereW is the ratio between the largest and smallest vertexweights in the graph. Our algorithm also achieves an f -approximation for the problem in O(f logn) rounds, improving over the classical result of [13] that achieves a running time of O(f log2 n). Finally, forweighted vertex cover (f = 2) our algorithm achieves a deterministic running time of O(logn), matching the randomized previously best result of [14]. We also show that integer covering-programs can be reduced to the Minimum Weight Set Cover problem in the distributed setting. This allows us to achieve an (f +ϵ)-approximate integral solution in (equation presented) rounds, where f bounds the number of variables in a constraint, δ bounds the number of constraints a variable appears in, and M = max {1, 1/amin}, where amin is the smallest normalized constraint coefficient. This significantly improves over the results of [16] for the integral case, which achieves the same guarantees in O (ϵ-4 · f4 · log f · log(M · δ) rounds.

Original languageEnglish
Title of host publicationPODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages104-106
Number of pages3
ISBN (Electronic)9781450362177
DOIs
StatePublished - 16 Jul 2019
Event38th ACM Symposium on Principles of Distributed Computing, PODC 2019 - Toronto, Canada
Duration: 29 Jul 20192 Aug 2019

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference38th ACM Symposium on Principles of Distributed Computing, PODC 2019
Country/TerritoryCanada
CityToronto
Period29/07/192/08/19

Keywords

  • Distributed computing
  • Graph algorithms
  • Primal dual
  • Set cover
  • Vertex cover

Fingerprint

Dive into the research topics of 'Brief Announcement: Optimal Distributed Covering Algorithms'. Together they form a unique fingerprint.

Cite this