Computers & Internet Books:

The Design of Competitive Online Algorithms via a Primal-Dual Approach

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!
$233.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $58.25 with Afterpay Learn more

6 weekly interest-free payments of $38.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 4-14 June using International Courier

Description

This book extends the primal-dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems. Among the online problems considered are the weighted caching problem, generalized caching, the set-cover problem, several graph optimization problems, routing, load balancing, and the problem of allocating ad-auctions. There is also an illustration of how classic online problems such as the ski rental problem and the dynamic TCP-acknowledgement problem can be solved optimally using a simple primal-dual approach. The Design of Competitive Online Algorithms Via a Primal-Dual Approach is an invaluable reference for anyone working in the area of computational theory, and especially those interested in exploring online scenarios that can benefit from the primal-dual framework.
Release date NZ
May 15th, 2009
Audience
  • Professional & Vocational
Pages
192
Dimensions
156x234x10
ISBN-13
9781601982162
Product ID
3010924

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...