Pages that link to "Item:Q598232"
From MaRDI portal
The following pages link to A local search approximation algorithm for \(k\)-means clustering (Q598232):
Displaying 22 items.
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
- \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
- Iterative denoising (Q626230) (← links)
- A novel 3D mesh compression using mesh segmentation with multiple principal plane analysis (Q733175) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- An approximation ratio for biclustering (Q975394) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- (Q5091190) (← links)
- (Q5091192) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- (Q5111721) (← links)
- Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
- Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
- (Q5874528) (← links)
- (Q5875462) (← links)
- Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)
- Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques (Q6053502) (← links)
- The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
- Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm (Q6139651) (← links)
