S. KarthikC.

activity

20152026

most citedBuilding Efficient and Compact Data Structures for Simplicial Complexes

27 citations · 41 across the 8 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

On Approximability of $ℓ_{2}^{2}$ Min-Sum Clustering

Karthik C. S., Euiwoong Lee, Yuval Rabani +2

The $ℓ_{2}^{2}$ min-sum $k$ -clustering problem is to partition an input set into clusters $C_{1}, \dots, C_{k}$ to minimize $\sum_{i = 1}^{k} \sum_{p, q \in C_{i}} ∥ p - q ∥_{2}^{2}$ . Although $\ell_2^2…

cs.CG2024

On connections between k-coloring and Euclidean k-means

Enver Aman, Karthik C. S., Sharath Punna

In the Euclidean $k$ -means problems we are given as input a set of $n$ points in $R^{d}$ and the goal is to find a set of $k$ points $C \subseteq R^{d}$ , so as to mini…

On Approximability of ℓ22​ Min-Sum Clustering

On connections between k-coloring and Euclidean k-means

On Approximability of $ℓ_{2}^{2}$ Min-Sum Clustering