We study the b-matching problem in bipartite graphs G=(S,R,E). Each
vert...
In the Online Machine Covering problem jobs, defined by their sizes, arr...
Power consumption is a dominant and still growing cost factor in data
ce...
Power consumption is the major cost factor in data centers. It can be re...
Scheduling with testing is a recent online problem within the framework ...
This paper studies Makespan Minimization in the secretary model. Formall...
Best Fit is a well known online algorithm for the bin packing problem, w...
The knapsack problem is one of the classical problems in combinatorial
o...
Suppose that n items arrive online in random order and the goal is to
se...
The problem of scheduling with testing in the framework of explorable
un...
Makespan minimization on identical machines is a fundamental problem in
...
Coflow scheduling models communication requests in parallel computing
fr...
Electricity cost is a dominant and rapidly growing expense in data cente...
The tendency to overestimate immediate utility is a common cognitive bia...