Fractional Set Cover in the Streaming Model

We study the Fractional Set Cover problem in the streaming model. That is, we consider the relaxation of the set cover problem over a universe of n elements and a collection of m sets, where each set can be picked fractionally, with a value in [0,1]. We present a randomized (1+a)-approximation algorithm that makes p passes over the data, and uses O(polylog(m,n,1/a) (mn^(O(1/(pa)))+n)) memory space. The algorithm works in both the set arrival and the edge arrival models. To the best of our knowledge, this is the first streaming result for the fractional set cover problem. We obtain our results by employing the multiplicative weights update framework in the streaming settings.

[1]  Yin Tat Lee,et al.  Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[2]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[3]  Sepehr Assadi,et al.  Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem , 2021, SIAM J. Comput..

[4]  Sepehr Assadi,et al.  Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem , 2017, PODS.

[5]  Kamesh Munagala,et al.  Efficient Primal-Dual Graph Algorithms for MapReduce , 2014, WAW.

[6]  Christos Koufogiannakis,et al.  A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs , 2013, Algorithmica.

[7]  Zeyuan Allen Zhu,et al.  Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel , 2014, SODA.

[8]  Amit Chakrabarti,et al.  Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover , 2015, SODA.

[9]  Vahab S. Mirrokni,et al.  Almost Optimal Streaming Algorithms for Coverage Problems , 2016, SPAA.

[10]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[11]  Graham Cormode,et al.  Set cover algorithms for very large datasets , 2010, CIKM.

[12]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[13]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  Dana Moshkovitz.  The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2015, Theory Comput..

[15]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[16]  Dana Moshkovitz,et al.  The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..

[17]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[18]  Piotr Indyk,et al.  Towards Tight Bounds for the Streaming Set Cover Problem , 2015, PODS.

[19]  Zeyuan Allen Zhu,et al.  Nearly-Linear Time Positive LP Solver with Faster Convergence Rate , 2015, STOC.

[20]  Di Wang,et al.  Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction , 2015, ICALP.

[21]  Andrew McGregor,et al.  Better Streaming Algorithms for the Maximum Coverage Problem , 2017, ICDT.

[22]  Adi Rosén,et al.  Semi-Streaming Set Cover , 2014, ACM Trans. Algorithms.

[23]  Alberto Caprara,et al.  A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..

[24]  Petros Drineas,et al.  Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms , 2005, STACS.

[25]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .

[26]  Piotr Indyk,et al.  On Streaming and Communication Complexity of the Set Cover Problem , 2014, DISC.

[27]  Ravi Kumar,et al.  Max-cover in map-reduce , 2010, WWW '10.

[28]  Andreas Krause,et al.  Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.

[29]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[30]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[31]  Kent Quanrud,et al.  Streaming Algorithms for Submodular Function Maximization , 2015, ICALP.

[32]  Lise Getoor,et al.  On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch , 2009, SDM.

[33]  Sudipto Guha,et al.  Linear programming in the semi-streaming model with application to the maximum matching problem , 2011, Inf. Comput..

[34]  Sanjeev Arora,et al.  The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..

[35]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.