4 papers · 1 filter
A Configuration-LP Framework for Connected -Median Clustering
Kushagra Chatterjee, Rojin Rezvan, Ali Vakilian
We study the \emph{connected -median} clustering problem, a clustering problem that augments the classical -median objective with connectivity constraints. We focus on the \e…
A Few Shared Random Bits Suffice for Constant-Round Almost Stable Matching
Yi-Jun Chang, Kushagra Chatterjee
We show that almost stable matching can be solved in constant distributed rounds on general bipartite graphs using only a few shared random bits. Specifically, in the $\c…
Creating Robust and Fair Graph Structures for Connectivity and Clustering
Kushagra Chatterjee
Graph algorithms are central to large-scale applications such as navigation systems, social networks, and data analysis platforms. This thesis studies two important challenges in s…
A Generic Framework for Fair Consensus Clustering in Streams
Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das +1
Consensus clustering seeks to combine multiple clusterings of the same dataset, potentially derived by considering various non-sensitive attributes by different agents in a multi-a…