Pages that link to "Item:Q5370732"
From MaRDI portal
The following pages link to k-means requires exponentially many iterations even in the plane (Q5370732):
Displayed 10 items.
- Tight lower bound instances for \(k\)-means++ in two dimensions (Q284583) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- A selection process for genetic algorithm using clustering analysis (Q2633197) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)