Pages that link to "Item:Q441888"

The following pages link to The planar \(k\)-means problem is NP-hard (Q441888):

Displaying 31 items.

• Tight lower bound instances for \(k\)-means++ in two dimensions (Q284583) (← links)
• Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
• Community detection using local neighborhood in complex networks (Q1618664) (← links)
• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
• Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 (Q1731982) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• Unsupervised anomaly detection in multivariate time series with online evolving spiking neural networks (Q2163196) (← links)
• \(k\)-means clustering of extremes (Q2180059) (← links)
• Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
• Sparse convex hull coverage (Q2230408) (← links)
• Initializing \(k\)-means clustering by bootstrap and data depth (Q2236768) (← links)
• Fair redistricting is hard (Q2272397) (← links)
• Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
• Energy efficiency optimization for multiple chargers in wireless rechargeable sensor networks (Q2672586) (← links)
• On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
• Good Clusterings Have Large Volume (Q4971590) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
• One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
• How to find a good explanation for clustering? (Q6136087) (← links)
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)