Approximation algorithms for fair k-median problem without fairness violation

DOI10.1016/J.TCS.2023.114332MaRDI QIDQ6185845zbMATH OpenFDO

Authors

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

• scientific article; zbMATH DE number 1775394 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithms for the Assignment and Transportation Problems
• Approximation Schemes for Capacitated Clustering in Doubling Metrics
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
• Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
• Bypassing the embedding
• Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
• On the cost of essentially fair clusterings
• On the existence of resonances in the transmission probability for interactions arising from derivatives of Dirac s delta function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185845)