Nikhil Ayyadevara
YOU?
Author Swipe
View article: Near-optimal Algorithms for Stochastic Online Bin Packing
Near-optimal Algorithms for Stochastic Online Bin Packing Open
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 minimum number of unit-sized bins. First, we study bin pa…
View article: A Decomposition Approach to the Weighted $k$-server Problem
A Decomposition Approach to the Weighted $k$-server Problem Open
A natural variant of the classical online $k$-server problem is the Weighted $k$-server problem, where the cost of moving a server is its weight times the distance through which it moves. Despite its apparent simplicity, the weighted $k$-s…
View article: On Minimizing Generalized Makespan on Unrelated Machines
On Minimizing Generalized Makespan on Unrelated Machines Open
We consider the Generalized Makespan Problem (GMP) on unrelated machines, where we are given $n$ jobs and $m$ machines and each job $j$ has arbitrary processing time $p_{ij}$ on machine $i$. Additionally, there is a general symmetric monot…
View article: Near-optimal Algorithms for Stochastic Online Bin Packing
Near-optimal Algorithms for Stochastic Online Bin Packing Open
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 minimum number of unit-sized bins. First, we study bin packin…
View article: The Randomized Competitive Ratio of Weighted $k$-server is at least Exponential
The Randomized Competitive Ratio of Weighted $k$-server is at least Exponential Open
The weighted $k$-server problem is a natural generalization of the $k$-server problem in which the cost incurred in moving a server is the distance traveled times the weight of the server. Even after almost three decades since the seminal …
View article: The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential Open
The weighted k-server problem is a natural generalization of the k-server problem in which the cost incurred in moving a server is the distance traveled times the weight of the server. Even after almost three decades since the seminal work…