65 citations · 69 across the 3 of their papers we have counts for
1 paper · 2 filters
Sepehr Assadi, Sanjeev Khanna, Yang Li
We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an α-approximate set cover (for any $α= o(\sqrt{n…