Approximation algorithms for the individually fair \(k\)-center with outliers

DOI10.1007/s10898-022-01195-3arXiv2201.04849MaRDI QIDQ6064038

Lu Han, Da-Chuan Xu, Ping Yang, Yicheng Xu

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.04849

zbMATH Keywords

outliersapproximation algorithm\(k\)-centerindividual fairness

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Local search algorithm for universal facility location problem with linear penalties
• Clustering to minimize the maximum intercluster distance
• Fault tolerant \(K\)-center problems
• A constant-factor approximation algorithm for the \(k\)-median problem
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Fair coresets and streaming algorithms for fair \(k\)-means
• \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
• A Best Possible Heuristic for the k-Center Problem
• The Capacitated K-Center Problem
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• Approximation Schemes for Capacitated Clustering in Doubling Metrics
• Constant approximation for k-median and k-means with outliers via iterative rounding
• On the cost of essentially fair clusterings

This page was built for publication: Approximation algorithms for the individually fair \(k\)-center with outliers