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.
€70.60
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● ISBN 9783319427492 ● Utgivare Springer International Publishing ● Publicerad 2016 ● Nedladdningsbara 3 gånger ● Valuta EUR ● ID 6303932 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare
Fler e-böcker från samma författare (r) / Redaktör
49 720 E-böcker i denna kategori
