Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model

Piotr Indyk, Ali Vakilian. Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. In Dan Suciu, Sebastian Skritek, Christoph Koch 0001, editors, Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019. pages 200-217, ACM, 2019. [doi]

@inproceedings{IndykV19,
  title = {Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model},
  author = {Piotr Indyk and Ali Vakilian},
  year = {2019},
  doi = {10.1145/3294052.3319691},
  url = {https://doi.org/10.1145/3294052.3319691},
  researchr = {https://researchr.org/publication/IndykV19},
  cites = {0},
  citedby = {0},
  pages = {200-217},
  booktitle = {Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019},
  editor = {Dan Suciu and Sebastian Skritek and Christoph Koch 0001},
  publisher = {ACM},
  isbn = {978-1-4503-6227-6},
}