On Streaming and Communication Complexity of the Set Cover Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian. On Streaming and Communication Complexity of the Set Cover Problem. In Fabian Kuhn, editor, Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings. Volume 8784 of Lecture Notes in Computer Science, pages 484-498, Springer, 2014. [doi]

This author has not been identified. Look up 'Erik D. Demaine' in GoogleThis author has not been identified. Look up 'Piotr Indyk' in GoogleThis author has not been identified. Look up 'Sepideh Mahabadi' in GoogleThis author has not been identified. Look up 'Ali Vakilian' in Google

runs on WebDSL