Decision-theoretic troubleshooting: hardness of approximation (Q2440184)
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: Decision-theoretic troubleshooting: hardness of approximation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decision-theoretic troubleshooting: hardness of approximation |
scientific article |
Statements
Decision-theoretic troubleshooting: hardness of approximation (English)
0 references
27 March 2014
0 references
decision-theoretic troubleshooting
0 references
hardness of approximation
0 references
NP-completeness
0 references
min-sum set cover
0 references
decision tree
0 references
0 references
0 references
0.8924919962882996
0 references
0.8861497640609741
0 references
0.8452168703079224
0 references
0.8442419767379761
0 references
0.8014590740203857
0 references
