In this paper, we propose a novel one-pass streaming algorithm which produces a prefix-optimal ordering of sets, which can easily be used to solve the Max-k- ...

A novel onepass streaming algorithm which produces a prefix-optimal ordering of sets, which can easily be used to solve the Max-k-Cover and the ...

Feb 3, 2022 · This setting captures the streaming Dominating Set problem and is more general and harder to solve than the Set Cover set-arrival setting, ...

Bibliographic details on Set Coverage Problems in a One-Pass Data Stream.

Jun 18, 2023 · 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 ...

Mar 17, 2016 · Abstract. We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem.

The set cover problem can be formulated in the well- established streaming model [1, 24], whereby the sets in S are presented one by one in a stream and the ...

Consider the following one-way communication complexity problem: • Alice: sets SS1,…,SSmm. • Bob: set SSBB. • Question: is SSBB disjoint from one ...

Abstract. State-of-the-art practical algorithms for solving large Set Cover instances can all be regarded as variants of the Greedy Set Cover algorithm.

Abstract. 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 ...