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 ● هوية شخصية 6303932 ● حماية النسخ Adobe DRM
يتطلب قارئ الكتاب الاليكتروني قادرة DRM