2 papers
cs.DS2025
Near-optimal Algorithms for Stochastic Online Bin Packing
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan +1
We study the online bin packing problem under two stochastic settings. In the bin packing problem, we are given n items with sizes in (0,1] and the goal is to pack them into the mi…
cs.DS2024
A Decomposition Approach to the Weighted -server Problem
Nikhil Ayyadevara, Ashish Chiplunkar, Amatya Sharma
A natural variant of the classical online -server problem is the Weighted -server problem, where the cost of moving a server is its weight times the distance through which it…