The following pages link to (Q5002778):
Displayed 12 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Algorithms for fair \(k\)-clustering with multiple protected attributes (Q2060384) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Efficient algorithms for fair clustering with a new notion of fairness (Q6052264) (← links)
- Attraction-repulsion clustering: a way of promoting diversity linked to demographic parity in fair clustering (Q6062810) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Making clusterings fairer by post-processing: algorithms, complexity results and experiments (Q6170399) (← links)