1 citations · 4 across the 12 of their papers we have counts for
6 papers · 1 filter
Fully Dynamic -Median with Near-Optimal Update Time and Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad
In metric -clustering, we are given as input a set of points in a general metric space, and we have to pick centers and cluster the input points around these chosen cent…
Even Faster -Edge Coloring via Shorter Multi-Step Vizing Chains
Sayan Bhattacharya, Martín Costa, Shay Solomon +1
Vizing's Theorem from 1964 states that any -vertex -edge graph with maximum degree can be {\em edge colored} using at most colors. For over 40 years, the state-of-…
Almost Optimal Fully Dynamic -Center Clustering with Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad +2
In this paper, we consider the \emph{metric -center} problem in the fully dynamic setting, where we are given a metric space evolving via a sequence of point insertions…
Vizing's Theorem in Near-Linear Time
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya +3
Vizing's theorem states that any -vertex -edge graph of maximum degree can be edge colored using at most different colors [Vizing, 1964]. Vizing's original proof i…
Fully Dynamic -Clustering with Fast Update Time and Small Recourse
Sayan Bhattacharya, Martín Costa, Naveen Garg +2
In the dynamic metric -median problem, we wish to maintain a set of centers in an input metric space that gets updated via point insertions/deletion…
Faster -Edge Coloring: Breaking the Time Barrier
Sayan Bhattacharya, Din Carmon, Martín Costa +2
Vizing's theorem states that any -vertex -edge graph of maximum degree can be {\em edge colored} using at most different colors [Diskret.~Analiz, '64]. Vizing's or…