Parameterized Distributed Algorithms
Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman

TL;DR
This paper studies parameterized graph problems in distributed models, establishing bounds and algorithms for problems like MVC, MaxIS, and MaxM, especially when solutions are small, advancing understanding of distributed complexity and approximation.
Contribution
It introduces new bounds and algorithms for parameterized distributed problems, including the first deterministic sub-quadratic CONGEST algorithms for certain approximations.
Findings
Lower bounds for distributed parameterized problems.
Optimal and near-optimal algorithms for MVC, MaxIS, MaxM.
Deterministic sub-quadratic CONGEST algorithms for approximation.
Abstract
In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \emph{parameter} exists and if so, it finds one. We study fundamental problems, including Minimum Vertex Cover (MVC), Maximum Independent Set (MaxIS), Maximum Matching (MaxM), and many others, in both the LOCAL and CONGEST distributed computation models. We present lower bounds for the round complexity of solving parameterized problems in both models, together with optimal and near-optimal upper bounds. Our results extend beyond the scope of parameterized problems. We show that any LOCAL -approximation algorithm for the above problems must take rounds. Joined with the algorithm of [GKM17] and the …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
