Pages that link to "Item:Q1702850"
From MaRDI portal
The following pages link to Faster algorithms for the constrained \(k\)-means problem (Q1702850):
Displaying 12 items.
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Tight FPT approximation for socially fair clustering (Q6161442) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
