Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model
Summary: Tight (up to polylogs) single-pass space–approximation tradeoff for max k‑coverage in the general edge‑arrival stream: optimal space Θ(m/α^2) for any α>1/(1−1/e). Also gives an Õ(m/α^2 + k)-space algorithm using vector sketches, linking sketching to streaming combinatorial optimization. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Piotr Indyk (Massachusetts Institute of Technology)
- 2. Ali Vakilian (Massachusetts Institute of Technology)
BibTeX Citation
@inproceedings{indyk_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319691},
doi = {10.1145/3294052.3319691},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Indyk, Piotr and Vakilian, Ali},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,233 | One Set to Cover All Maximal Cliques Approximately | 2022 | SIGMOD | 5.6658655e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 482 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00017772185 |
| 1,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00011984702 |
| 4,194 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS | 6.8426144e-05 |
| 4,739 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS | 6.5285049e-05 |
| 5,668 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS | 6.127897e-05 |
| 6,275 | BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory | 2017 | PODS | 5.9299343e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,959 | Composable Core-sets for Diversity and Coverage Maximization | 2014 | PODS |
| 2 | 5,669 | Data Streams with Bounded Deletions | 2018 | PODS |
| 3 | 8,666 | Efficient framework for operating on data sketches | 2023 | VLDB |
| 4 | 6,901 | Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems | 2008 | SIGMOD |
| 5 | 11,528 | Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size | 2022 | PODS |
| 6 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 7 | 11,640 | Estimating the Size of Union of Sets in Streaming Models | 2021 | PODS |
| 8 | 11,373 | Set Cover in the One-pass Edge-arrival Streaming Model | 2023 | PODS |
| 9 | 4,194 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS |
| 10 | 5,668 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS |