Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight approximation bounds for combinatorial frugal coverage algorithms |
scientific article; zbMATH DE number 6194365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight approximation bounds for combinatorial frugal coverage algorithms |
scientific article; zbMATH DE number 6194365 |
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
0.9711093
0 references
0 references
0 references
0.90283096
0 references
0.90129906
0 references
0.8991396
0 references
0.89744604
0 references
