Problems and algorithms for covering arrays via set covers (Q2333828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7129502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problems and algorithms for covering arrays via set covers |
scientific article; zbMATH DE number 7129502 |
Statements
Problems and algorithms for covering arrays via set covers (English)
0 references
13 November 2019
0 references
covering arrays
0 references
set covers
0 references
weighted budgeted covering arrays
0 references
weighted budgeted set covers
0 references
greedy heuristic algorithms
0 references
0.8556830883026123
0 references
0.8161938786506653
0 references
0.8156144022941589
0 references
