Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772)
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: Approximation algorithms for some intractable problems of choosing a vector subsequence |
scientific article; zbMATH DE number 6460008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for some intractable problems of choosing a vector subsequence |
scientific article; zbMATH DE number 6460008 |
Statements
Approximation algorithms for some intractable problems of choosing a vector subsequence (English)
0 references
17 July 2015
0 references
search for a vector subset
0 references
minimum sum of squares of distances
0 references
cluster analysis
0 references
NP-hardness
0 references
efficient approximation algorithm
0 references
0.8306024074554443
0 references
0.8185410499572754
0 references
0.8161077499389648
0 references
0.8000330924987793
0 references
