Online Computation and Competitive Analysis (Volume 0)
by Allan Borodin, Ran El-Yaniv
A foundational reference on online algorithms and competitive analysis, covering paging, k-server problems, and metrical task systems with formal proofs and examples.
About This Book
Online Computation and Competitive Analysis provides a rigorous introduction to the theory and techniques of online algorithms.
The book examines competitive analysis as a framework for evaluating algorithm performance without knowledge of future inputs.
Topics include paging, k-server problems, and metrical task systems, presented with formal proofs and examples.
It serves as a key reference for graduate students and researchers in theoretical computer science and algorithm design.
Reviews
No reviews yet. Be the first to review this book!