Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:31, 5 March 2024
scientific article; zbMATH DE number 6460008
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
