Computational experience with approximation algorithms for the set covering problem (Q1278941)
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: Computational experience with approximation algorithms for the set covering problem |
scientific article; zbMATH DE number 1255842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational experience with approximation algorithms for the set covering problem |
scientific article; zbMATH DE number 1255842 |
Statements
Computational experience with approximation algorithms for the set covering problem (English)
0 references
28 February 1999
0 references
set covering
0 references
NP-hard
0 references
randomized greedy algorithm
0 references
neural network
0 references
0 references
0 references
0 references
0.9216608
0 references
0.90153754
0 references
0.89662445
0 references
0.8955939
0 references
0.88446087
0 references
