The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (Q5384533)
From MaRDI portal
scientific article; zbMATH DE number 7072325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem |
scientific article; zbMATH DE number 7072325 |
Statements
The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (English)
0 references
24 June 2019
0 references
component selection
0 references
approximation algorithms
0 references
NP-completeness
0 references
set cover
0 references
red-blue set cover
0 references
0 references
