A 2-approximation polynomial algorithm for a clustering problem (Q5263825): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Alexander Kel'Manov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Vladimir Khandeev / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1990478913040066 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2131416339 / rank | |||
Normal rank | |||
Latest revision as of 08:45, 30 July 2024
scientific article; zbMATH DE number 6460058
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2-approximation polynomial algorithm for a clustering problem |
scientific article; zbMATH DE number 6460058 |
Statements
A 2-approximation polynomial algorithm for a clustering problem (English)
0 references
17 July 2015
0 references
cluster analysis
0 references
search for a vector subset
0 references
computational complexity
0 references
approximation polynomial
0 references
approximation algorithm
0 references
