The following pages link to (Q5091191):
Displaying 14 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← 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)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- (Q5874534) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- Tight FPT approximation for socially fair clustering (Q6161442) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)
