The advice model of online computation captures the setting in which the online algorithm is
given some information concerning the request sequence. This paradigm allows to establish …

Until now, the reigning computing paradigm has been Cloud Computing, whose facilities
concentrate in large and remote areas. Novel data-intensive services with critical latency …

Bin packing is a classic optimization problem with a wide range of applications, from load
balancing to supply chain management. In this work, we study the online variant of the …

A variant of the online knapsack problem is considered in the settings of trusted and
untrusted predictions. In Unit Profit Knapsack, the items have unit profit, and it is easy to find …

Efficient production scheduling in computer server industry remains a critical challenge. This
challenge becomes particularly acute during the testing phase, where servers are assigned …

A variant of the online knapsack problem is considered in the setting of predictions. In Unit
Profit Knapsack, the items have unit profit, ie, the goal is to pack as many items as possible …

We study a generalization of the advice complexity model of online computation in which the
advice is provided by an untrusted source. Our objective is to quantify the impact of …

We study ordinal makespan scheduling on small numbers of identical machines, with
respect to two parallel solutions. In ordinal scheduling, it is known that jobs are sorted by …

Many scientists apply fully dynamic bin packing problem solving for resource allocation of
virtual machines in cloud environments. The goal of problem-solving is to reduce the …

The bin covering problem asks for covering a maximum number of bins with an online
sequence of n items of different sizes in the range (0, 1; a bin is said to be covered if it …