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.
购买此电子书可免费获赠一本!
语言 英语 ● 格式 PDF ● ISBN 9783319427492 ● 出版者 Springer International Publishing ● 发布时间 2016 ● 下载 3 时 ● 货币 EUR ● ID 6303932 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器