The following pages link to (Q5368726):
Displayed 41 items.
- Clustering through continuous facility location problems (Q346248) (← links)
- Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
- Spectral concentration and greedy \(k\)-clustering (Q1624584) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem (Q2132392) (← links)
- Model assisted variable clustering: minimax-optimal recovery and algorithms (Q2176610) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
- Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- (Q4558500) (← links)
- A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
- (Q4633019) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- (Q5009501) (← links)
- Coresets for Fuzzy K-Means with Applications (Q5091038) (← links)
- (Q5091192) (← links)
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
- Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
- (Q5874516) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- (Q5875522) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
- The computational complexity of some explainable clustering problems (Q6121425) (← links)
- A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)