A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems

This paper presents a distributed algorithm in the CONGEST model that achieves a $(1+\epsilon )$-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+\epsilon )$-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 $\epsilon$.