The design and analysis of algorithms deals with extracting certain information from
instances of computational problems. In a way, this information is “hidden” in the instances …

We study the advice complexity, which is a tool to measure the amount of information
necessary to achieve a certain output quality, of a specific online scheduling problem. A …