000			01743 a2200265 4500
008			240424b 2023|||||||| |||| 00| 0 eng d
020			_a9781009349185 (PB)
041			_aeng
080			_a510.6 _bVAZE
100			_aVaze, Rahul
245			_aOnline Algorithms
260			_bCambridge University Press _c2023 _aUK
300			_axxii, 465p.
504			_aIncludes Bibliography(439-461) and Index
520			_aOnline algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but 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. The book starts with classical online paradigms like the ski-rental, paging, list-accessing, bin packing, where performance of online algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts.
650			_aMathematics
650			_aAlgorithmics
650			_aComplexity
650			_aComputer Algebra
650			_aComputational Geometry
650			_aComputer Science
650			_aOptimisation
690			_aMathematics
942			_cBK
999			_c60116 _d60116