Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight approximation bounds for combinatorial frugal coverage algorithms |
scientific article |
Statements
Tight approximation bounds for combinatorial frugal coverage algorithms (English)
0 references
2 August 2013
0 references
frugal coverage
0 references
set cover
0 references
set packing
0 references
approximation algorithms
0 references
0 references
0 references
