Pages that link to "Item:Q598232"

The following pages link to A local search approximation algorithm for \(k\)-means clustering (Q598232):

Displaying 50 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)
• Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
• A novel method for image segmentation using reaction-diffusion model (Q1698427) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• The spherical \(k\)-means++ algorithm via local search (Q2039652) (← links)
• Local search algorithm for the spherical \(k\)-means problem with outliers (Q2039653) (← 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)
• The spherical \(k\)-means++ algorithm via local search scheme (Q2084616) (← links)
• An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
• Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem (Q2132392) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
• Global optimality in \(k\)-means clustering (Q2195470) (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
• Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
• Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
• The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
• An enhanced genetic algorithm with new mutation for cluster analysis (Q2319499) (← links)
• A three-stage approach for segmenting degraded color images: smoothing, lifting and thresholding (SLaT) (Q2412744) (← links)
• Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Frequency-based views to pattern collections (Q2489656) (← links)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← 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)