On the complexity of some Euclidean problems of partitioning a finite set of points
From MaRDI portal
Publication:521408
DOI10.1134/S1064562416060089zbMath1364.68219OpenAlexW2571047813MaRDI QIDQ521408
Alexander Kel'Manov, Artem V. Pyatkin
Publication date: 11 April 2017
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562416060089
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Uses Software
Cites Work
This page was built for publication: On the complexity of some Euclidean problems of partitioning a finite set of points