Dynamic k-Median with Worst-Case Update Time and Recourse

We study fully dynamic metric k-median under unit-weight client insertions and deletions. After each update, the algorithm must maintain at most k centers chosen from the current client locations. We give a randomized constant-factor approximation algorithm with O(k) worst-case update time and O((1+logΔ)³) worst-case center recourse, where $Δ$ is the aspect ratio of the underlying metric space. The approximation guarantee holds simultaneously over any prescribed finite adaptive update sequence with high probability, while the update time and recourse bounds hold on every execution. We also obtain the same asymptotic guarantees for metric k-means.