ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.10378
  4. Cited By
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering

A Polynomial-Time Approximation for Pairwise Fair kkk-Median Clustering

16 May 2024
Sayan Bandyapadhyay
E. Chlamtác
Yu. S. Makarychev
A. Vakilian
Yury Makarychev
Ali Vakilian
ArXivPDFHTML

Papers citing "A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering"

1 / 1 papers shown
Title
Approximating Fair Clustering with Cascaded Norm Objectives
Approximating Fair Clustering with Cascaded Norm Objectives
E. Chlamtác
Yury Makarychev
A. Vakilian
74
23
0
08 Nov 2021
1