Pages that link to "Item:Q542229"
From MaRDI portal
The following pages link to On the complexity of a search for a subset of ``similar'' vectors (Q542229):
Displaying 17 items.
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← 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)
- 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)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
- PTAS for problems of vector choice and clustering with different centers (Q6644072) (← links)
