Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1990478912040059 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078342465 / rank | |||
Normal rank | |||
Latest revision as of 08:31, 30 July 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
