33 citations · 122 across the 14 of their papers we have counts for
Showing 2016 · cs.DSShow all
3 papers · 2 filters
cs.DS2016★ 1 cited
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…
cs.DS2016★ 2 cited
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…
cs.DS2016
The Non-Uniform k-Center Problem
Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space and a collection of balls of radii ,…