Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
Summary: Shows any α-approx streaming set-cover algorithm requires Ω(m n^{1/α}) space even with polylog(n) passes and random-order streams, matching Har-Peled et al.'s O(α)-pass upper bound. Also gives tight lower bounds for (1−ε)-approx streaming maximum coverage, settling the space complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sepehr Assadi (University of Pennsylvania)
BibTeX Citation
@inproceedings{assadi_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056116},
doi = {10.1145/3034786.3056116},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Assadi, Sepehr},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 5.5657914e-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 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,194 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS | 6.8426144e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,669 | Data Streams with Bounded Deletions | 2018 | PODS |
| 2 | 2,959 | Composable Core-sets for Diversity and Coverage Maximization | 2014 | PODS |
| 3 | 6,901 | Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems | 2008 | SIGMOD |
| 4 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 5 | 10,305 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 6 | 11,528 | Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size | 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 | 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS |
| 10 | 4,194 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS |