The computational complexity of and approximation algorithms for variants of the component selection problem (Q5384533)
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: The computational complexity of and approximation algorithms for variants of the component selection problem |
scientific article; zbMATH DE number 7072325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.952690362930298
0 references
0.8123090267181396
0 references
0.7694920897483826
0 references
