This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs.
This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
- ISBN: 978-3-319-42747-8
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 349
- Fecha Publicación: 29/11/2016
- Nº Volúmenes: 1
- Idioma: Inglés