Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
Authors:
Journal:
Conference:
This paper resolves an open question raised
by Har-Peled, Indyk, Mahabadi, and Vakilian in [HIMV'16]
regarding the single-pass streaming complexity of the set cover problem.
Abstract:
Conference version:
Journal version:
Full version:
Presentation slides:
BibTex: