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…
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…
Popular Edges with Critical Nodes
Kushagra Chatterjee, Prajakta Nimbhorkar
In the popular edge problem, the input is a bipartite graph where and denote a set of men and a set of women respectively, and each vertex in h…
Pairwise Reachability Oracles and Preservers under Failures
Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary
In this paper, we consider reachability oracles and reachability preservers for directed graphs/networks prone to edge/node failures. Let be a directed graph on -no…