Pages that link to "Item:Q5875470"

The following pages link to On the cost of essentially fair clusterings (Q5875470):

Displaying 13 items.

• 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)
• 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)
• Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• Tight FPT approximation for socially fair clustering (Q6161442) (← links)
• Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)
• The fair \(k\)-center with outliers problem: FPT and polynomial approximations (Q6535817) (← links)
• Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
• A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
• Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)