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.
Koop dit e-boek en ontvang er nog 1 GRATIS!
Taal Engels ● Formaat PDF ● ISBN 9783319427492 ● Uitgeverij Springer International Publishing ● Gepubliceerd 2016 ● Downloadbare 3 keer ● Valuta EUR ● ID 6303932 ● Kopieerbeveiliging Adobe DRM
Vereist een DRM-compatibele e-boeklezer