Set Cover in the One-pass Edge-arrival Streaming Model
Summary: Considers Set Cover in the one-pass edge-arrival streaming model (tuples (S,u)), capturing Dominating Set and strictly harder than set-arrival. Proves a strong adversarial vs random-order separation: adversarial streams need Õ(m) space for Õ(√n)-approx (lower bound), while random-order admits an Õ(√n)-approx with Õ(m/√n) space, and gives an adversarial α-approx tradeoff with space Õ((m n^2)/α^2). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sanjeev Khanna (University of Pennsylvania)
- 2. Christian Konrad (University of Bristol)
- 3. Cezar-Mihail Alexandru (University of Bristol)
BibTeX Citation
@inproceedings{khanna_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Set Cover in the One-pass Edge-arrival Streaming Model}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588678},
doi = {10.1145/3584372.3588678},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khanna, Sanjeev and Konrad, Christian and Alexandru, Cezar-Mihail},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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 |
| 5,668 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS | 6.127897e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,291 | A Framework for Adversarially Robust Streaming Algorithms | 2020 | PODS |
| 2 | 10,181 | Representation Obliviousness and Pseudodeterminism in Streaming Algorithms | 2026 | PODS |
| 3 | 6,901 | Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems | 2008 | SIGMOD |
| 4 | 10,305 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 5 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 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 | 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | 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 |