On the complexity of some Euclidean problems of partitioning a finite set of points
DOI10.1134/S1064562416060089zbMATH Open1364.68219OpenAlexW2571047813MaRDI QIDQ521408FDOQ521408
Authors: A. V. Kel'manov, Artem 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
Recommendations
- NP-hardness of some Euclidean problems of partitioning a finite set of points
- On the complexity of some quadratic Euclidean partition problems into balanced clusters
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
- NP-hardness of some quadratic Euclidean 2-clustering problems
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- The elements of statistical learning. Data mining, inference, and prediction
- Pattern recognition and machine learning.
- Title not available (Why is that?)
- On the complexity of some Euclidean optimal summing problems
- Complexity of certain problems of searching for subsets of vectors and cluster analysis
- Data mining. The textbook
Cited In (16)
- On the complexity of some quadratic Euclidean partition problems into balanced clusters
- Title not available (Why is that?)
- On clustering problems with connected optima in Euclidean spaces
- NP-hardness of some Euclidean problems of partitioning a finite set of points
- On complexity of some problems of cluster analysis of vector sequences
- On the complexity of some Euclidean optimal summing problems
- NP-hardness of some quadratic Euclidean 2-clustering problems
- NP-hardness of some max-min clustering problems
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
- Title not available (Why is that?)
- On the complexity of some quadratic Euclidean 2-clustering problems
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- On the complexity and approximability of some Euclidean optimal summing problems
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- Computing Plurality Points and Condorcet Points in Euclidean Space
Uses Software
This page was built for publication: On the complexity of some Euclidean problems of partitioning a finite set of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521408)
