81 citations · 310 across the 59 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Efficient Algorithms and Hardness Results for the Weighted -Server Problem
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
In this paper, we study the weighted -server problem on the uniform metric in both the offline and online settings. We start with the offline setting. In contrast to the (unweig…
cs.DS2023
The Price of Explainability for Clustering
Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson +1
Given a set of points in -dimensional space, an explainable clustering is one where the clusters are specified by a tree of axis-aligned threshold cuts. Dasgupta et al. (ICML 20…
cs.DS2023
Set Covering with Our Eyes Wide Shut
Anupam Gupta, Gregory Kehne, Roie Levin
In the stochastic set cover problem (Grandoni et al., FOCS '08), we are given a collection of sets over a universe of size , and a distribution $…