Pages that link to "Item:Q506167"

The following pages link to Improved and simplified inapproximability for \(k\)-means (Q506167):

Displaying 15 items.

• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
• The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
• The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• (Q5091192) (← links)
• Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)