Towards Tight Bounds for the Streaming Set Cover Problem
Summary: O(1/δ)-pass streaming algorithm for Set Cover using ~O(m n^δ) space with logarithmic approximation, improving prior pass complexity. Tight lower bounds: exact requires Ω~(m n^δ) for (1/(2δ)-1) passes; geometric variant uses ~O(n) space; one-pass randomized needs Ω(m n). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sariel Har-Peled (University of Illinois Urbana-Champaign)
- 2. Piotr Indyk (Massachusetts Institute of Technology)
- 3. Sepideh Mahabadi (Massachusetts Institute of Technology)
- 4. Ali Vakilian (Massachusetts Institute of Technology)
BibTeX Citation
@inproceedings{harpeled_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Towards Tight Bounds for the Streaming Set Cover Problem}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902287},
doi = {10.1145/2902251.2902287},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Har-Peled, Sariel and Indyk, Piotr and Mahabadi, Sepideh and Vakilian, Ali},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,668 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS | 6.127897e-05 |
| 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 5.5657914e-05 |
| 11,170 | Counterfactual Explanation at Will, with Zero Privacy Leakage | 2024 | SIGMOD | 5.093636e-05 |
| 11,373 | Set Cover in the One-pass Edge-arrival Streaming Model | 2023 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,724 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD |
| 2 | 3,919 | Optimal Bounds for Approximate Counting | 2022 | PODS |
| 3 | 2,959 | Composable Core-sets for Diversity and Coverage Maximization | 2014 | PODS |
| 4 | 10,305 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 5 | 11,640 | Estimating the Size of Union of Sets in Streaming Models | 2021 | PODS |
| 6 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 7 | 11,528 | Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size | 2022 | PODS |
| 8 | 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS |
| 9 | 11,373 | Set Cover in the One-pass Edge-arrival Streaming Model | 2023 | PODS |
| 10 | 5,668 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS |