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. 2403.10365
  4. Cited By
Scalable Algorithms for Individual Preference Stable Clustering

Scalable Algorithms for Individual Preference Stable Clustering

15 March 2024
Ron Mosenzon
A. Vakilian
ArXivPDFHTML

Papers citing "Scalable Algorithms for Individual Preference Stable Clustering"

4 / 4 papers shown
Title
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
A Polynomial-Time Approximation for Pairwise Fair kkk-Median Clustering
Sayan Bandyapadhyay
E. Chlamtác
Yu. S. Makarychev
A. Vakilian
Yury Makarychev
Ali Vakilian
27
1
0
16 May 2024
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
Feature-based Individual Fairness in k-Clustering
Feature-based Individual Fairness in k-Clustering
Debajyoti Kar
Mert Kosan
Debmalya Mandal
Sourav Medya
A. Silva
P. Dey
Swagato Sanyal
FaML
26
9
0
09 Sep 2021
Clustering is difficult only when it does not matter
Clustering is difficult only when it does not matter
Amit Daniely
N. Linial
M. Saks
44
36
0
22 May 2012
1