A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems

Download PDF
Open Webpage

Qian Li, Minghui Ouyang, Yuyi Wang

Published: 2024, Last Modified: 15 May 2025ISAAC 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This paper presents a distributed algorithm in the CONGEST model that achieves a (1+ε)-approximation for row-sparse fractional covering problems (RS-FCP) and the dual column-sparse fraction packing problems (CS-FPP). Compared with the best-known (1+ε)-approximation CONGEST algorithm for RS-FCP/CS-FPP developed by Kuhn, Moscibroda, and Wattenhofer (SODA'06), our algorithm is not only much simpler but also significantly improves the dependency on ε.