Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse

Documenti analoghi

• Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2024)
• Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2024)
• Deterministic $k$-Median Clustering in Near-Optimal Time
  di: Costa, Martín, et al.
  Pubblicazione: (2025)
• Fully Dynamic Euclidean k-Means
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2025)
• Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2026)