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

Documenti analoghi

• Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
  di: Friggstad, Zachary, et al.
  Pubblicazione: (2024)
• Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
  di: Nezhad, Sina Bagheri, et al.
  Pubblicazione: (2025)
• Max-Cut with Multiple Cardinality Constraints
  di: Makarychev, Yury, et al.
  Pubblicazione: (2025)
• Approximation algorithms for satisfiable and nearly satisfiable ordering CSPs
  di: Makarychev, Yury
  Pubblicazione: (2026)
• FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
  di: Bandyapadhyay, Sayan, et al.
  Pubblicazione: (2023)