4 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 1 cited
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
Andrew McGregor, David Tench, Hoa T. Vu
We present algorithms for the Max-Cover and Max-Unique-Cover problems in the data stream model. The input to both problems are subsets of a universe of size and a value $k\…
cs.DS2015★ 4 cited
Densest Subgraph in Dynamic Graph Streams
Andrew McGregor, David Tench, Sofya Vorotnikova +1
In this paper, we consider the problem of approximating the densest subgraph in the dynamic graph stream model. In this model of computation, the input graph is defined by an arbit…