New algorithms for fair \(k\)-center problem with outliers and capacity constraints

DOI10.1016/J.TCS.2024.114515MaRDI QIDQ6128707

Jianxin Wang, Qilong Feng, Jinhui Xu, Xiaoliang Wu

Publication date: 16 April 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fairnessapproximation algorithm\(k\)-center

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• The fault-tolerant capacitated \(K\)-center problem
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• 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
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• Maximal Flow Through a Network
• A Best Possible Heuristic for the k-Center Problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• 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: New algorithms for fair \(k\)-center problem with outliers and capacity constraints