D C ] 1 7 A ug 2 01 8 Optimal Distributed Weighted Set Cover Approximation

@inproceedings{BenBasat2018DC,
  title={D C ] 1 7 A ug 2 01 8 Optimal Distributed Weighted Set Cover Approximation},
  author={Ran Ben-Basat and Ken-ichi Kawarabayashi and Gregory Schwartzman},
  year={2018}
}
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 requires O(log ∆/ log log ∆) rounds, for constants ǫ ∈ (0, 1] and f ∈ N. This is the… CONTINUE READING