Pages that link to "Item:Q2921753"

The following pages link to How fast is the \(k\)-means method? (Q2921753):

Displaying 10 items.

• 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)
• A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• How fast is the \(k\)-means method? (Q1763158) (← links)
• The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
• Pointwise convergence of the Lloyd I algorithm in higher dimension (Q2820188) (← links)
• A General Hybrid Clustering Technique (Q3391264) (← links)
• Light Euclidean Spanners with Steiner Points (Q5874539) (← links)