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.
Achetez cet ebook et obtenez-en 1 de plus GRATUITEMENT !
Langue Anglais ● Format PDF ● ISBN 9783319427492 ● Maison d’édition Springer International Publishing ● Publié 2016 ● Téléchargeable 3 fois ● Devise EUR ● ID 6303932 ● Protection contre la copie Adobe DRM
Nécessite un lecteur de livre électronique compatible DRM