On Streaming and Communication Complexity of the Set Cover Problem

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]

@inproceedings{DemaineIMV14,
  title = {On Streaming and Communication Complexity of the Set Cover Problem},
  author = {Erik D. Demaine and Piotr Indyk and Sepideh Mahabadi and Ali Vakilian},
  year = {2014},
  doi = {10.1007/978-3-662-45174-8_33},
  url = {http://dx.doi.org/10.1007/978-3-662-45174-8_33},
  researchr = {https://researchr.org/publication/DemaineIMV14},
  cites = {0},
  citedby = {0},
  pages = {484-498},
  booktitle = {Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings},
  editor = {Fabian Kuhn},
  volume = {8784},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-45173-1},
}