Tight bounds for single-pass streaming complexity of the set cover problem

Sepehr Assadi, Sanjeev Khanna, Yang Li. Tight bounds for single-pass streaming complexity of the set cover problem. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 698-711, ACM, 2016. [doi]

Abstract

Abstract is missing.