Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems

Documenti analoghi

• Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
  di: Cheng, Kangke, et al.
  Pubblicazione: (2026)
• Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
  di: Mo, Guanlin, et al.
  Pubblicazione: (2024)
• An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2025)
• Fully Dynamic Euclidean k-Means
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2025)
• Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
  di: Habib, Ruhan, et al.
  Pubblicazione: (2025)