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
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,124 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS | 6.9485903e-05 |
| 5,592 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS | 6.222801e-05 |
Previous
Page 1 / 1
Next