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.
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● ISBN 9783319427492 ● Yayımcı Springer International Publishing ● Yayınlanan 2016 ● İndirilebilir 3 kez ● Döviz EUR ● Kimlik 6303932 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir