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
- 2. Piotr Indyk
- 3. Sepideh Mahabadi
- 4. Ali Vakilian
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,066 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS | 5.7223891e-05 |
| 7,145 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 4.8179617e-05 |
| 10,954 | Counterfactual Explanation at Will, with Zero Privacy Leakage | 2024 | SIGMOD | 4.1945683e-05 |
| 11,167 | Set Cover in the One-pass Edge-arrival Streaming Model | 2023 | PODS | 4.1945683e-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