4 papers
Multidimensional Resource Scheduling with Small Demands
Yossi Azar, Rathish Das, Hao Sun
We study multidimensional resource scheduling. Each job has a -dimensional resource-demand vector and a processing time . The scheduler assigns a start time to ea…
Offline Local Search for Online Stochastic Bandits
Gerdus Benadè, Rathish Das, Thomas Lavastida
Combinatorial multi-armed bandits provide a fundamental online decision-making environment where a decision-maker interacts with an environment across time steps, each time sel…
Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
Rathish Das, Hao Sun
We study the precedence-constrained resource scheduling problem [SICOMP'75]. There are jobs where each job takes a certain time to finish and has a resource requirement through…
Robustly Guarding Polygons
Rathish Das, Omrit Filtser, Matthew J. Katz +1
We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point gua…