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

DOI10.1007/978-3-031-39344-0_17MaRDI QIDQ6535817zbMATH OpenFDO

Authors Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jianxin Wang

Publication date 28 February 2024

Full work available at URL https://doi.org/10.1007/978-3-031-39344-0_17

zbMATH Keywords

approximation algorithmfair k-centerk-center

Mathematics Subject Classification ID

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

Recommendations

• New algorithms for fair \(k\)-center problem with outliers and capacity constraints
• Approximation algorithms for the individually fair k-center with outliers
• Fair colorful \(k\)-center clustering
• Fair colorful k-center clustering
• Clustering what matters: optimal approximation for clustering with outliers

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A local search approximation algorithm for \(k\)-means clustering
• A Lottery Model for Center-Type Problems With Outliers
• Achieving anonymity via clustering
• Algorithms for facility location problems with outliers. (Extended abstract)
• Approximation algorithms for clustering problems with lower bounds and outliers
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Fault tolerant \(K\)-center problems
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
• Maximal Flow Through a Network
• On the cost of essentially fair clusterings
• Semi-supervised learning on Riemannian manifolds
• The Capacitated K-Center Problem
• The fault-tolerant capacitated \(K\)-center problem
• The Non-Uniform k -Center Problem
• The non-uniform k-center problem
• Tight FPT approximation for constrained k-center and k-supplier

Cited in

(3)

• Approximation algorithms for the individually fair k-center with outliers
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints
• Tight FPT approximation for socially fair clustering

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

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