ResearchTrend.AI
Tight FPT Approximation for Socially Fair Clustering
v1v2 (latest)

Tight FPT Approximation for Socially Fair Clustering

Dishant Goyal
Ragesh Jaiswal
ArXiv (abs)PDFHTML

Papers citing "Tight FPT Approximation for Socially Fair Clustering"

4 / 4 papers shown
Title
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
Suhas Thejaswi
Ameet Gadekar
Bruno Ordozgoiti
Aristides Gionis
89
3
0
10 Jan 2024
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
F. Abbasi
Sandip Banerjee
J. Byrka
Parinya Chalermsook
Ameet Gadekar
K. Khodamoradi
D. Marx
Roohani Sharma
J. Spoerhase
46
6
0
12 May 2023
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Parameterized Approximation Schemes for Clustering with General Norm Objectives
F. Abbasi
Sandip Banerjee
J. Byrka
Parinya Chalermsook
Ameet Gadekar
K. Khodamoradi
D. Marx
Roohani Sharma
J. Spoerhase
68
13
0
06 Apr 2023
Fair Minimum Representation Clustering
Fair Minimum Representation Clustering
Connor Lawless
Oktay Gunluk
FaML
70
2
0
06 Feb 2023