Related references
Note: Only part of the references are listed.Fair Clustering via Equitable Group Representations
Mohsen Abbasi et al.
PROCEEDINGS OF THE 2021 ACM CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY, FACCT 2021 (2021)
MpUFLP: Universal facility location problem in the p-th power of metric space
Yicheng Xu et al.
THEORETICAL COMPUTER SCIENCE (2020)
Fair Coresets and Streaming Algorithms for Fair k-means
Melanie Schmidt et al.
APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019) (2020)
Clustering without Over-Representation
Sara Ahmadian et al.
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING (2019)
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
Ravishankar Krishnaswamy et al.
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2018)
Local search algorithm for universal facility location problem with linear penalties
Yicheng Xu et al.
JOURNAL OF GLOBAL OPTIMIZATION (2017)
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization
Jaroslaw Byrka et al.
ACM TRANSACTIONS ON ALGORITHMS (2017)
A 1.488 approximation algorithm for the uncapacitated facility location problem
Shi Li
INFORMATION AND COMPUTATION (2013)
A constant-factor approximation algorithm for the k-median problem
M Charikar et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2002)
Fault tolerant K-center problems
S Khuller et al.
THEORETICAL COMPUTER SCIENCE (2000)
The capacitated K-center problem
S Khuller et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2000)
Share Paper
