Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > RANDOMIZED WINNOWING:
Reports tagged with Randomized Winnowing:
TR07-092 | 10th July 2007
Piotr Berman, Bhaskar DasGupta

#### Approximating the Online Set Multicover Problems Via Randomized Winnowing

In this paper, we consider the weighted online set k-multicover problem. In this problem, we have an universe V of elements, a family SS of subsets of V with a positive real cost for every S\in SS, and a coverage factor'' (positive integer) k. A subset \{i_0,i_1,\ldots\ \subseteq V of ... more >>>

ISSN 1433-8092 | Imprint