Abstract
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 bound results give robust bounds on what is possible using semi-online algorithms. On the other hand, when the advice is of an obtainable form, algorithms using advice can lead to semi-online algorithms. There are strong relationships between advice complexity and randomization, and advice complexity has led to the introduction of the first complexity classes for online problems.
This survey concerning online algorithms with advice explains the models, motivates the study in general, presents some examples of the work that has been carried out, and includes a fairly complete set of references, organized by problem studied.
This survey concerning online algorithms with advice explains the models, motivates the study in general, presents some examples of the work that has been carried out, and includes a fairly complete set of references, organized by problem studied.
| Original language | English |
|---|---|
| Journal | S I G A C T News |
| Volume | 47 |
| Issue number | 3 |
| Pages (from-to) | 93-129 |
| ISSN | 0163-5700 |
| DOIs | |
| Publication status | Published - 2016 |