Fractional Set Cover in the Streaming Model
Name
LIPIcs-APPROX-RANDOM-2017-12.pdf
Description
Published version
Size
741.13 KB
Format
Adobe PDF
Checksum (MD5)
167f0dc70f45df40e7a59d75fa67a090
Author(s)
Indyk, Piotr
Mahabadi, Sepideh
Rubinfeld, Ronitt
Ullman, Jonathan
Vakilian, Ali
Yodipinyanee, Anak
Date Issued
2017
Citation
Indyk, Piotr, Mahabadi, Sepideh, Rubinfeld, Ronitt, Ullman, Jonathan, Vakilian, Ali et al. 2017. "Fractional Set Cover in the Streaming Model."
Version
Final published version
Abstract
© Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, and Anak Yodpinyanee. 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+)- approximation algorithm that makes p passes over the data, and uses eO(mnO(1/p) +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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
http://drops.dagstuhl.de/opus/volltexte/2017/7561/pdf/LIPIcs-APPROX-RANDOM-2017-12.pdf
