6 citations · 9 across the 3 of their papers we have counts for
3 papers
The Heterogeneous Capacitated -Center Problem
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
In this paper we initiate the study of the heterogeneous capacitated -center problem: given a metric space , and a collection of capacities. The goal is to op…
Online and Dynamic Algorithms for Set Cover
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1
In this paper, we study the set cover problem in the fully dynamic model. In this model, the set of active elements, i.e., those that must be covered at any given time, can change…
Relax, no need to round: integrality of clustering formulations
Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar +3
We study exact recovery conditions for convex relaxations of point cloud clustering problems, focusing on two of the most common optimization problems for unsupervised clustering:…