Martín Costa

activity

20232026

k

-Center Clustering with Recourse

1 citations · 4 across the 12 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

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.DS2025

Fully Dynamic Euclidean k-Means

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad +3

We consider the Euclidean $k$ -means clustering problem in a dynamic setting, where we have to explicitly maintain a solution (a set of $k$ centers) $S \subseteq R^{d}$ subje…

cs.DS2025

Deterministic $k$ -Median Clustering in Near-Optimal Time

Martín Costa, Ermiya Farokhnejad

The metric $k$ -median problem is a textbook clustering problem. As input, we are given a metric space $V$ of size $n$ and an integer $k$ , and our task is to find a subset $S \subse…

Vizing's Theorem in Deterministic Almost-Linear Time

Fully Dynamic Euclidean k-Means

Deterministic k-Median Clustering in Near-Optimal Time

Deterministic $k$ -Median Clustering in Near-Optimal Time