NP-hardness of some Quadratic Euclidean 2-clustering problems
- 1 September 2015
- journal article
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 92 (2), 634-637
- https://doi.org/10.1134/s1064562415050233
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Complexity of the weighted max-cut in Euclidean spaceJournal of Applied and Industrial Mathematics, 2014
- NP-hardness of the Euclidean Max-Cut problemDoklady Mathematics, 2014
- On the complexity of some cluster analysis problemsComputational Mathematics and Mathematical Physics, 2011
- On the complexity of some data analysis problemsComputational Mathematics and Mathematical Physics, 2010
- Complexity of certain problems of searching for subsets of vectors and cluster analysisComputational Mathematics and Mathematical Physics, 2009
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- On the complexity of a search for a subset of “similar” vectorsDoklady Mathematics, 2008
- A Randomized Approximation Scheme for Metric MAX-CUTJournal of Computer and System Sciences, 2001
- On the Complexity of Clustering ProblemsPublished by Springer Science and Business Media LLC ,1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976