A new approximation algorithm for \(k\)-set cover problem (Q1639350)
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: A new approximation algorithm for \(k\)-set cover problem |
scientific article; zbMATH DE number 6886639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for \(k\)-set cover problem |
scientific article; zbMATH DE number 6886639 |
Statements
A new approximation algorithm for \(k\)-set cover problem (English)
0 references
12 June 2018
0 references
set-cover problem
0 references
SCP
0 references
approximation algorithm
0 references
greedy algorithm
0 references
NP-complete optimization problem
0 references
0 references
0.9306582
0 references
0.9239112
0 references
0.9232633
0 references
0.9221295
0 references
0.9165464
0 references
0.91642666
0 references
0.9152883
0 references
