Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > SET MULTICOVER:
Reports tagged with Set multicover:
TR07-092 | 10th July 2007
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 >>>