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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Sepehr Assadi' in GoogleThis author has not been identified. Look up 'Sanjeev Khanna' in GoogleThis author has not been identified. Look up 'Yang Li' in Google

runs on WebDSL