31 citations · 53 across the 20 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Greedy k-Center from Noisy Distance Samples
Neharika Jali, Nikhil Karamchandani, Sharayu Moharir
We study a variant of the canonical k-center problem over a set of vertices in a metric space, where the underlying distances are apriori unknown. Instead, we can query an oracle w…
cs.DS2016
Paging with Multiple Caches
Rahul Vaze, Sharayu Moharir
Modern content delivery networks consist of one or more back-end servers which store the entire content catalog, assisted by multiple front-end servers with limited storage and ser…