A Semi-Streaming Set Cover
نویسندگان
چکیده
formalized in terms of a hypergraph G = (V,E) whose edges arrive one-by-one and the goal is to construct an edge cover F ⊆ E with the objective of minimizing the cardinality (or cost in the weighted case) of F . We further consider a parameterized relaxation of this problem, where given some 0 ≤ < 1, the goal is to construct an edge (1− )-cover, namely, a subset of edges incident to all but an -fraction of the vertices (or
منابع مشابه
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover
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 is allowed only O(n poly{log n, log m}) space to process this stream. For each p > 1, we give a very simple deterministic algorithm that makes p passes over the input stream and returns an appropriately certified (p ...
متن کاملAn Efficient Streaming Algorithm for the Submodular Cover Problem
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 single pass streaming algorithm using sublinear memory in the size of the stream will fail to provide any non-trivial approximation guarantees for SSC. Hence, we consider a relaxed version of SSC, where we only seek to find ...
متن کاملFractional Set Cover in the Streaming Model
We study the Fractional Set Cover problem in the streaming model. That is, we consider the relaxation of the set cover problem over a universe of n elements and a collection of m sets, where each set can be picked fractionally, with a value in [0, 1]. We present a randomized (1 + ε)approximation algorithm that makes p passes over the data, and uses Õ(mnO(1/pε) +n) memory space. The algorithm wo...
متن کاملApproximation Algorithms for Independent Set Problems on Hypergraphs
This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, local search and partitioning algorithms. We introduce a general technique, called shrinkage reducti...
متن کاملOn Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch
We generalize the graph streaming model to hypergraphs. In this streaming model, hyperedges are arriving online and any computation has to be done on-the-fly using a small amount of space. Each hyperedge can be viewed as a set of elements (nodes), so we refer to our proposed model as the “set-streaming” model of computation. We consider the problem of “maximum coverage”, in which k sets have to...
متن کامل