Online Algorithms
- Publisher's listprice GBP 54.99
-
27 830 Ft (26 505 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 2 783 Ft off)
- Discounted price 25 047 Ft (23 855 Ft + 5% VAT)
27 830 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 16 November 2023
- ISBN 9781009349185
- Binding Paperback
- No. of pages575 pages
- Size 237x183x23 mm
- Weight 710 g
- Language English 791
Categories
Short description:
A rigorous and comprehensive introduction to online algorithms in a pedagogy-rich, readily accessible form for students.
MoreLong description:
Online 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.
MoreTable 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.
More
