Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
Name
3742476.pdf
Size
709.19 KB
Format
Adobe PDF
Checksum (MD5)
832a0d4011779bc60da1680daac81bd0
Author(s)
Faour, Salwa
Ghaffari, Mohsen
Grunau, Christoph
Kuhn, Fabian
Rozho?, V?clav
Journal
ACM Transactions on Algorithms
Publisher
ACM
Citation
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň. 2025. Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. ACM Trans. Algorithms 21, 4, Article 42 (October 2025), 48 pages.
Version
Final published version
Abstract
We develop a general deterministic distributed method for locally rounding fractional solutions of graph problems for which the analysis can be broken down into analyzing pairs of vertices. Roughly speaking, the method can transform fractional/probabilistic label assignments of the vertices into integral/deterministic label assignments for the vertices, while approximately preserving a potential function that is a linear combination of functions, each of which depends on at most two vertices (subject to some conditions usually satisfied in pairwise analyses). The method unifies and significantly generalizes prior work on deterministic local rounding techniques [Ghaffari, Kuhn FOCS'21; Harris FOCS'19; Fischer, Ghaffari, Kuhn FOCS'17; Fischer DISC' to obtain polylogarithmic-time deterministic distributed solutions for combinatorial graph problems. Our general rounding result enables us to locally and efficiently derandomize a range of distributed algorithms for local graph problems, including maximal independent set (MIS), maximum-weight independent set approximation, and minimum-cost set cover approximation.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1145/3742476
