Doesn't suit? No problem! You can return within 30 days
You won't go wrong with a gift voucher. The gift recipient can choose anything from our offer.
30-day return policy
This textbook explains online computation in different settings, with particular emphasis on the paging problem and advice complexity. The book is organized into chapters on randomization, advice complexity, 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?