Pages that link to "Item:Q2995693"
From MaRDI portal
The following pages link to Complexity of certain problems of searching for subsets of vectors and cluster analysis (Q2995693):
Displaying 18 items.
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
- On polynomial solvability of one quadratic Euclidean clustering problem on a line (Q2279767) (← links)
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- On the complexity of some cluster analysis problems (Q2901122) (← links)
- (Q3115213) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
