Pages that link to "Item:Q906118"
From MaRDI portal
The following pages link to NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118):
Displaying 19 items.
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- Norm statistics and the complexity of clustering problems (Q1026145) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- NP-hardness of some max-min clustering problems (Q2026156) (← links)
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem (Q4965097) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (Q5090149) (← links)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
- Max-Min Problems of Searching for Two Disjoint Subsets (Q6488359) (← links)
