A major technique in learning-augmented online algorithms is combining
m...
Paging is a prototypical problem in the area of online algorithms. It ha...
A polygon C is an intersecting polygon for a set O of objects in the pla...
Given the rapid rise in energy demand by data centers and computing syst...
We study the online problem of minimizing power consumption in systems w...
We consider the online search problem in which a server starting at the
...
Consider the problem where n jobs, each with a release time, a deadline ...
We consider the problem of managing the buffer of a shared-memory switch...
We consider minimum-cardinality Manhattan connected sets with arbitrary
...
We study the variant of the Euclidean Traveling Salesman problem where
i...
The classical analysis of online algorithms, due to its worst-case natur...
Machine-learned predictors, although achieving very good results for inp...
Given n jobs with release dates, deadlines and processing times we consi...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are g...
In the online matching on the line problem, the task is to match a set o...