Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101)
From MaRDI portal
scientific article; zbMATH DE number 7315673
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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