On Streaming and Communication Complexity of the Set Cover Problem. Demaine, E. D.; Indyk, P.; Mahabadi, S.; and Vakilian, A. In Proceedings of International Symposium on Distributed Computing (DISC), pages 484-498, 2014.
On Streaming and Communication Complexity of the Set Cover Problem [link]Paper  bibtex   
@inproceedings{ dblp1703235,
  title = {On Streaming and Communication Complexity of the Set Cover Problem},
  author = {Erik D. Demaine and Piotr Indyk and Sepideh Mahabadi and Ali Vakilian},
  author_short = {Demaine, E. D. and Indyk, P. and Mahabadi, S. and Vakilian, A.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2014},
  key = {dblp1703235},
  id = {dblp1703235},
  biburl = {http://www.dblp.org/rec/bibtex/conf/wdag/DemaineIMV14},
  url = {http://dx.doi.org/10.1007/978-3-662-45174-8_33},
  conference = {DISC},
  pages = {484-498},
  text = {DISC 2014:484-498},
  booktitle = {Proceedings of International Symposium on Distributed Computing (DISC)}
}
Downloads: 0