Pages that link to "Item:Q506167"
From MaRDI portal
The following pages link to Improved and simplified inapproximability for \(k\)-means (Q506167):
Displaying 6 items.
- 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)
