Approximation algorithms for fair k-median problem without fairness violation
From MaRDI portal
Publication:6185845
DOI10.1016/J.TCS.2023.114332MaRDI QIDQ6185845FDOQ6185845
Authors:
Publication date: 8 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A tight bound on approximating arbitrary metrics by tree metrics
- Algorithms for the Assignment and Transportation Problems
- Title not available (Why is that?)
- 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
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- On the cost of essentially fair clusterings
- Approximation Schemes for Capacitated Clustering in Doubling Metrics
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
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)
