"Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"--
"Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"--
Inhaltsverzeichnis
Preface; Acknowledgements; Notations; Chapter 1. Introduction; Chapter 2. Ski-Rental; Chapter 3. List Accessing; Chapter 4. Bin-Packing; Chapter 5. Paging; Chapter 6. Metrical Task System; Chapter 7. Secretary Problem; Chapter 8. Knapsack; Chapter 9. Bipartite Matching; Chapter 10. Primal¿Dual Technique; Chapter 11. Facility Location and k-Means Clustering; Chapter 12. Load Balancing; Chapter 13. Scheduling to Minimize Flow Time (Delay); Chapter 14. Scheduling with Speed Scaling; Chapter 15. Scheduling to Minimize Energy with Job Deadlines; Chapter 16. Travelling Salesman; Chapter 17. Convex Optimization (Server Provisioning in Cloud Computing); Chapter 18. Multi-Commodity Flow Routing; Chapter 19. Resource Constrained Scheduling (Energy Harvesting Communication); Chapter 20. Submodular Partitioning for Welfare Maximization; Appendix 1. Types of Adversaries and Their Relationships; Appendix 2. KKT Conditions for Convex Optimization Problems; Bibliography; Index.
