Optimal distributed covering algorithms

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 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 Kuhn et al. (SODA, 2006)whose running time is O(log Δ+ log W) , where W is the ratio between the largest and smallest vertex weights in the graph. Our algorithm also achieves an f-approximation for the problem in O(flog n) rounds, improving over the classical result of Khuller et al. (J Algorithms, 1994) that achieves a running time of O(flog ²n). Finally, for weighted vertex cover (f= 2) our algorithm achieves a deterministic running time of O(log n) , matching the randomized previously best result of Koufogiannakis and Young (Distrib Comput, 2011). 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⌈ log ₂(M) + 1 ⌉ + ε) -approximate integral solution in O((1+f/logn)·(logΔloglogΔ+(f·logM)1.01·logε-1·(logΔ)0.01))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 / a_min⌉ } , where a_min is the smallest normalized constraint coefficient.