Complexity of certain problems of searching for subsets of vectors and cluster analysis
From MaRDI portal
Publication:2995693
Cited in
(18)- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- On polynomial solvability of one quadratic Euclidean clustering problem on a line
- NP-hardness of some Euclidean problems of partitioning a finite set of points
- On the complexity of some quadratic Euclidean 2-clustering problems
- On the complexity of some cluster analysis problems
- A randomized algorithm for two-cluster partition of a set of vectors
- NP-hardness of some quadratic Euclidean 2-clustering problems
- scientific article; zbMATH DE number 6007853 (Why is no real title available?)
- Complexity and algorithms for finding a subset of vectors with the longest sum
- A randomized algorithm for a sequence 2-clustering problem
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- K-means clustering via a nonconvex optimization approach
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- On the complexity of some Euclidean problems of partitioning a finite set of points
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
This page was built for publication: Complexity of certain problems of searching for subsets of vectors and cluster analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995693)
