Rahul Vaze (Tata Institute of Fundamental Research, Mumbai, India)

Online Algorithms

• Broschiertes Buch

Produktbeschreibung

This textbook provides a 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. A wide range of solved examples and practice exercises are included, allowing hands-on exposure to the basic concepts.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 488
• Erscheinungstermin: 16. November 2023
• Englisch
• Abmessung: 246mm x 189mm x 26mm
• Gewicht: 716g
• ISBN-13: 9781009349185
• ISBN-10: 100934918X
• Artikelnr.: 67401761

Inhaltsangabe

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.