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.
Compre este e-book e ganhe mais 1 GRÁTIS!
Língua Inglês ● Formato PDF ● ISBN 9783319427492 ● Editora Springer International Publishing ● Publicado 2016 ● Carregável 3 vezes ● Moeda EUR ● ID 6303932 ● Proteção contra cópia Adobe DRM
Requer um leitor de ebook capaz de DRM