Online algorithms
by Gerhard Woeginger
About
This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.
Discuss Online algorithms with other readers
Join or start a book club for Online algorithms on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Online algorithms?
Sign up free on Readfeed, then browse public clubs or start your own club with Online algorithms as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Online algorithms with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Online algorithms with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.