Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 8 February 2024
scientific article; zbMATH DE number 5682403
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search |
scientific article; zbMATH DE number 5682403 |
Statements
Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (English)
0 references
17 March 2010
0 references
approximation algorithms
0 references
set cover
0 references
