Online Algorithms
Online Algorithms
$69.99
USDOnline 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.
- Focus on describing the basic ideas and key concepts useful for the considered problem, together with elegant analysis
- Alternative algorithms also provided along with the more commonly known ones for the sake of exposition
- Examples broken down into simpler parts to provide a clear path towards the solution
- End-of-chapter exercises to allow the student to get hands-on exposure to the basic concepts covered
Product details
No date availablePaperback
9781009349185
575 pages
237 × 183 × 23 mm
0.71kg
Temporarily unavailable - available from TBC
Table of Contents
- 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.
