Tight approximation bounds for combinatorial frugal coverage algorithms
We consider the frugal coverage problem, an interesting variation of set cover defined as follows. Instances of the problem consist of a universe of elements and a collection of sets over these elements; the objective is to compute a subcollection of sets so that the number of elements it covers plu...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Springer
2012
|