In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …

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 …

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 …

Evolutionary algorithms have been reported to be efficient metaheuristics for the
optimization of several NP-Hard combinatorial optimization problems. In addition to their …

Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …

With declaring the highly transmissible COVID-19 as a pandemic, an unprecedented strain
on healthcare infrastructures worldwide occurred. An enormous shortage in the personal …

The advice complexity of an online problem describes the additional information both
necessary and sufficient for online algorithms to compute solutions of a certain quality. In this …

We consider the setting of online computation with advice and study the bin packing
problem and a number of scheduling problems. We show that it is possible, for any of these …

We provide simple but surprisingly useful direct product theorems for proving lower bounds
on online algorithms with a limited amount of advice about the future. As a consequence, we …

App vendors now have a new way to deploy applications on edge servers thanks to the rise
of edge cloud computing. App vendors will be able to deliver better services to users …