The following pages link to (Q4598213):
Displaying 17 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- (Q5874473) (← links)
- (Q5874534) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
