On the complexity and approximability of some Euclidean optimal summing problems (Q506239)
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: On the complexity and approximability of some Euclidean optimal summing problems |
scientific article; zbMATH DE number 6679157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity and approximability of some Euclidean optimal summing problems |
scientific article; zbMATH DE number 6679157 |
Statements
On the complexity and approximability of some Euclidean optimal summing problems (English)
0 references
31 January 2017
0 references
Euclidean space
0 references
cluster analysis
0 references
search for a subset
0 references
norm of sum
0 references
NP-hardness
0 references
pseudopolynomial solvability
0 references
discrete optimization problems
0 references
0 references
0.9653558731079102
0 references
0.8158036470413208
0 references
0.811461329460144
0 references
