Pages that link to "Item:Q486976"

The following pages link to A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976):

Displaying 12 items.

• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes (Q1705776) (← links)
• Sampling in space restricted settings (Q1750353) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)