Fair colorful \(k\)-center clustering

DOI10.1007/s10107-021-01674-7OpenAlexW3185641196MaRDI QIDQ2118132

Ola Svensson, Xinrui Jia, Kshiteej Sheth

Publication date: 22 March 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01674-7

zbMATH Keywords

fairnessapproximation algorithms\(k\)-centerclustering and facility location

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Related Items (3)

Approximation algorithms for diversity-bounded center problems ⋮ A parameterized approximation scheme for generalized partial vertex cover ⋮ An approximation algorithm for diversity-aware fair \(k\)-supplier problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• Global Optimization with Polynomials and the Problem of Moments
• Lift-and-Project Methods for Set Cover and Knapsack
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
• New Tools for Graph Coloring
• A Best Possible Heuristic for the k-Center Problem
• A Lottery Model for Center-Type Problems With Outliers
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints
• CSP gaps and reductions in the lasserre hierarchy
• Complexity of Positivstellensatz proofs for the knapsack

This page was built for publication: Fair colorful \(k\)-center clustering