3 citations · 5 across the 3 of their papers we have counts for
6 papers · 1 filter
Online Min-Max Paging
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale +1
Motivated by fairness requirements in communication networks, we introduce a natural variant of the online paging problem, called \textit{min-max} paging, where the objective is to…
The Randomized Competitive Ratio of Weighted -server is at least Exponential
Nikhil Ayyadevara, Ashish Chiplunkar
The weighted -server problem is a natural generalization of the -server problem in which the cost incurred in moving a server is the distance traveled times the weight of the…
How to Solve Fair -Center in Massive Data Models
Ashish Chiplunkar, Sagar Kale, Sivaramakrishnan Natarajan Ramamoorthy
Fueled by massive data, important decision making is being automated with the help of algorithms, therefore, fairness in algorithms has become an especially important research topi…
Testing Graph Clusterability: Algorithms and Lower Bounds
Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna +2
We consider the problem of testing graph cluster structure: given access to a graph , can we quickly determine whether the graph can be partitioned into a few clusters wi…
Set Cover with Delay -- Clairvoyance is not Required
Yossi Azar, Ashish Chiplunkar, Shay Kutten +1
In most online problems with delay, clairvoyance (i.e. knowing the future delay of a request upon its arrival) is required for polylogarithmic competitiveness. In this paper, we sh…
Prophet Secretary: Surpassing the Barrier
Yossi Azar, Ashish Chiplunkar, Haim Kaplan
In the Prophet Secretary problem, samples from a known set of probability distributions arrive one by one in a uniformly random order, and an algorithm must irrevocably pick one of…