The fair \(k\)-center with outliers problem: FPT and polynomial approximations

DOI10.1007/978-3-031-39344-0_17zbMATH Open1547.68675MaRDI QIDQ6535817

Qilong Feng, Jianxin Wang, Jinhui Xu, Xiaoliang Wu

Publication date: 28 February 2024

zbMATH Keywords

approximation algorithmk-centerfair k-center

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• The fault-tolerant capacitated \(K\)-center problem
• Semi-supervised learning on Riemannian manifolds
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Fault tolerant \(K\)-center problems
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
• Achieving anonymity via clustering
• Maximal Flow Through a Network
• A Best Possible Heuristic for the k-Center Problem
• The Capacitated K-Center Problem
• A local search approximation algorithm for k-means clustering
• Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
• A Lottery Model for Center-Type Problems With Outliers
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• On the cost of essentially fair clusterings
• The Non-Uniform k -Center Problem

This page was built for publication: The fair \(k\)-center with outliers problem: FPT and polynomial approximations