The maximum independent set problem is a classic optimization problem that has also been studied quite intensively in the distributed setting. While the problem is hard to approximate in general, there are good approximation algorithms known for several sparse graph families. In this paper, we consider deterministic distributed CONGEST algorithms for the weighted version of the problem in trees and graphs of bounded arboricity. For trees, we prove that the task of deterministically computing a (1−ε)-approximate solution to the maximum weight independent set (MWIS) problem has a tight Θ(log∗(n)/ε) complexity. The lower bound already holds on unweighted oriented paths. On the upper bound side, we show that the bound can be achieved even in unrooted trees. For graphs
Nearby in the stack
G=(V,E)
of arboricity
β>1
, we give two algorithms. If the sum of all node weights is
w(V)
, we show that for any
ε>0
, an independent set of weight at least
(1−ε)⋅4βw(V)
can be computed in
O(log2(β/ε)/ε+log∗n)
rounds. This result is obtained by a direct application of the local rounding framework of Faour, Ghaffari, Grunau, Kuhn, and Rozhoň [SODA '23]. We further show that for any
ε>0
, an independent set of weight at least
(1−ε)⋅2β+1w(V)
can be computed in
O(log3(β)⋅log(1/ε)/ε2⋅logn)
rounds. This improves on a recent result of Gil [OPODIS '23], who showed that a
1/⌊(2+ε)β⌋
-approximation to the MWIS problem can be computed in
O(β⋅logn)
rounds. As an intermediate step, we design an algorithm to compute an independent set of total weight at least