In this paper, we introduce the public-private framework of data summarization motivated by
privacy concerns in personalized recommender systems and online social services. Such …

We resolve the space complexity of single-pass streaming algorithms for approximating the
classic set cover problem. For finding an α-approximate set cover (for α= o (√ n)) via a …

We present new lower bounds that show that a polynomial number of passes are necessary
for solving some fundamental graph problems in the streaming model of computation. For …

Maximum coverage and minimum set cover problems---here collectively called coverage
problems---have been studied extensively in streaming models. However, previous research …

This article studies the set cover problem under the semi-streaming model. The underlying
set system is formalized in terms of a hypergraph G=(V, E) whose edges arrive one by one …

We give a polynomial-time algorithm for Online-SetCover with a competitive ratio of
O(\logmn) when the elements are revealed in random order, matching the best possible …

We consider the classic Set Cover problem in the data stream model. For n elements and m
sets (m≥ n) we give a O (1/δ)-pass algorithm with a strongly sub-linear~ O (mnδ) space and …

We study the classic set cover problem in the streaming model: the sets that comprise the
instance are revealed one by one in a stream and the goal is to solve the problem by making …

Set cover, over a universe of size n, may be modelled as a data-streaming problem, where
the m sets that comprise the instance are to be read one by one. A semi-streaming algorithm …

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming
model which we refer to as the Streaming Submodular Cover (SSC). We show that any …