Online Computation And Competitive Analysis
Download Online Computation And Competitive Analysis PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Online Computation And Competitive Analysis book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Online Computation and Competitive Analysis
Author: Allan Borodin
language: en
Publisher: Cambridge University Press
Release Date: 2005-02-17
Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.
An Introduction to Online Computation
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.
WALCOM: Algorithms and Computation
This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.