Approximation algorithms for fair \(k\)-median problem without fairness violation

DOI10.1016/j.tcs.2023.114332MaRDI QIDQ6185845

No author found.

Publication date: 8 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

clusteringapproximation algorithm\(k\)-median

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
• Algorithms for the Assignment and Transportation Problems
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• Bypassing the embedding
• On the existence of resonances in the transmission probability for interactions arising from derivatives of Dirac s delta function
• Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Approximation Schemes for Capacitated Clustering in Doubling Metrics
• On the cost of essentially fair clusterings
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Approximation algorithms for fair \(k\)-median problem without fairness violation