Sayan Bhattacharya

collaborators

2 papers

cs.DS2025

Vizing's Theorem in Deterministic Almost-Linear Time

Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya +3

Vizing's theorem states that any $n$ -vertex $m$ -edge graph of maximum degree $Δ$ can be edge colored using at most $Δ + 1$ different colors. Vizing's original proof is easily transl…

cs.DS2024

Fully Dynamic $k$ -Median with Near-Optimal Update Time and Recourse

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad

In metric $k$ -clustering, we are given as input a set of $n$ points in a general metric space, and we have to pick $k$ centers and cluster the input points around these chosen cent…

Vizing's Theorem in Deterministic Almost-Linear Time

Fully Dynamic k-Median with Near-Optimal Update Time and Recourse

Fully Dynamic $k$ -Median with Near-Optimal Update Time and Recourse