Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101)
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: Easy NP-hardness Proofs of Some Subset Choice Problems |
scientific article; zbMATH DE number 7315673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Easy NP-hardness Proofs of Some Subset Choice Problems |
scientific article; zbMATH DE number 7315673 |
Statements
Easy NP-hardness Proofs of Some Subset Choice Problems (English)
0 references
25 February 2021
0 references
Euclidean space
0 references
subset choice
0 references
clustering
0 references
2-partition
0 references
strong NP-hardness
0 references
0 references
0 references
0 references
0.88644135
0 references
0.86830026
0 references
0.85963136
0 references
0.8583241
0 references
0.85480094
0 references
0 references
0.8461261
0 references
0.84330904
0 references
