Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Are there any recent books on Online Algorithms? I know of only two books on the subject.

  • Online Computation and Competitive Analysis by Allan Borodin and Ran El-Yaniv: This is a classic but old book, and does not contain many recent advances in the field.
  • The Design of Competitive Online Algorithms via a Primal-Dual Approach by Niv Buchbinder and Joseph (Seffi) Naor: This is a new book and contains lot of recent results. However, it's scope is limited to LP based primal-dual algorithms.

Please list here all the books on Online Algorithms that you may know. If there are any books freely available on the web, that will be great.

share|cite|improve this question
Sounds like a CW questions ? definitely a big-list – Suresh Venkat Dec 3 '12 at 4:52
have noticed on over ~1yr a seeming uptick in interest in online algorithms for eg misc std graph problems, seems to tie in with trends around "big data" (& cloud algorithms etc). & it would seem there are not great refs on the subj so far, the coverage seems more scattered right now... in many cases taking efficient offline algorithms & making/adapting them to online scenarios is an extremely nontrivial/advanced area... maybe early signs of a paradigm shift in progress? – vzn Dec 3 '12 at 18:48
up vote 1 down vote accepted

It seems that there are no recent books or survey papers on online algorithms.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.