Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings

11/20/2021
by   Salwa Faour, et al.
0

We provide CONGEST model algorithms for approximating minimum weighted vertex cover and the maximum weighted matching. For bipartite graphs, we show that a (1+ε)-approximate weighted vertex cover can be computed deterministically in polylogarithmic time. This generalizes a corresponding result for the unweighted vertex cover problem shown in [Faour, Kuhn; OPODIS '20]. Moreover, we show that in general weighted graph families that are closed under taking subgraphs and in which we can compute an independent set of weight at least a λ-fraction of the total weight, one can compute a (2-2λ +ε)-approximate weighted vertex cover in polylogarithmic time in the CONGEST model. Our result in particular implies that in graphs of arboricity a, one can compute a (2-1/a+ε)-approximate weighted vertex cover. For maximum weighted matchings, we show that a (1-ε)-approximate solution can be computed deterministically in polylogarithmic CONGEST rounds (for constant ε). We also provide a more efficient randomized algorithm. Our algorithm generalizes results of [Lotker, Patt-Shamir, Pettie; SPAA '08] and [Bar-Yehuda, Hillel, Ghaffari, Schwartzman; PODC '17] for the unweighted case. Finally, we show that even in the LOCAL model and in bipartite graphs of degree ≤ 3, if ε<ε_0 for some constant ε_0>0, then computing a (1+ε)-approximation for the unweighted minimum vertex cover problem requires Ω(log n/ε) rounds. This generalizes aresult of [Göös, Suomela; DISC '12], who showed that computing a (1+ε_0)-approximation in such graphs requires Ω(log n) rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2020

Approximate Bipartite Vertex Cover in the CONGEST Model

We give efficient distributed algorithms for the minimum vertex cover pr...
research
08/11/2017

The generalized vertex cover problem and some variations

In this paper we study the generalized vertex cover problem (GVC), which...
research
10/01/2019

Approximating the Percolation Centrality through Sampling and Pseudo-dimension

In this work we investigate the problem of percolation centrality, a gen...
research
11/13/2017

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

A bipartite graph G=(U,V,E) is convex if the vertices in V can be linear...
research
01/23/2019

Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications

Given a weighted hypergraph H(V, E⊆ 2^V, w), the approximate k-cover pro...
research
02/25/2019

Optimal Distributed Covering Algorithms

We present a time-optimal deterministic distributed algorithm for approx...
research
06/17/2018

Greedy and Local Ratio Algorithms in the MapReduce Model

MapReduce has become the de facto standard model for designing distribut...

Please sign up or login with your details

Forgot password? Click here to reset