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.
Acquista questo ebook e ricevine 1 in più GRATIS!
Lingua Inglese ● Formato PDF ● ISBN 9783319427492 ● Casa editrice Springer International Publishing ● Pubblicato 2016 ● Scaricabile 3 volte ● Moneta EUR ● ID 6303932 ● Protezione dalla copia Adobe DRM
Richiede un lettore di ebook compatibile con DRM