TY - GEN
T1 - Fractional set cover in the streaming model
AU - Indyk, Piotr
AU - Mahabadi, Sepideh
AU - Rubinfeld, Ronitt
AU - Ullman, Jonathan
AU - Vakilian, Ali
AU - Yodpinyanee, Anak
N1 - Publisher Copyright:
© Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, and Anak Yodpinyanee.
PY - 2017/8/1
Y1 - 2017/8/1
N2 - 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.
AB - 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.
KW - Fractional Set Cover
KW - LP relaxation
KW - Multiplicative Weight Update
KW - Streaming Algorithms
UR - http://www.scopus.com/inward/record.url?scp=85028714379&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.APPROX/RANDOM.2017.12
DO - 10.4230/LIPIcs.APPROX/RANDOM.2017.12
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85028714379
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017
A2 - Rolim, Jose D. P.
A2 - Jansen, Klaus
A2 - Williamson, David P.
A2 - Vempala, Santosh S.
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017
Y2 - 16 August 2017 through 18 August 2017
ER -