Online Algorithms
Download Online Algorithms PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Online Algorithms 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 Algorithms
Author: Rahul Vaze
language: en
Publisher: Cambridge University Press
Release Date: 2023-09-30
This textbook provides a rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverage of most of the important topics is presented with special emphasis on elegant analysis. A wide range of solved examples and practice exercises are included, allowing hands-on exposure to the basic concepts.
Approximation and Online Algorithms
Author: Roberto Solis-Oba
language: en
Publisher: Springer Science & Business Media
Release Date: 2004-02-12
This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Approximation and Online Algorithms, WAOA 2003, held in Budapest, Hungary in September 2003. The 19 revised full papers presented together with 5 invited abstracts of the related ARACNE mini-symposium were carefully selected from 41 submissions during two rounds of reviewing and improvement. Among the topics addressed are competitive analysis, inapproximability results, randomization techniques, approximation classes, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and financial problems.
Approximation and Online Algorithms
This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.