The following pages link to (Q2921753):
Displaying 5 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)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- A General Hybrid Clustering Technique (Q3391264) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)