- We will send in 10–14 business days.
/images/books/11350034/9781601982162.jpg)
- Author: Niv Buchbinder
- Publisher: Now Publishers
- Year: 2009
- Pages: 192
- ISBN-10: 160198216X
- ISBN-13: 9781601982162
- Format: 15.6 x 23.4 x 1 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
The Design of Competitive Online Algorithms via a Primal-Dual Approach (e-book) (used book) | bookbook.eu
Reviews
Description
The Design of Competitive Online Algorithms via a Primal-Dual Approach 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
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.19:08:00
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Niv Buchbinder
- Publisher: Now Publishers
- Year: 2009
- Pages: 192
- ISBN-10: 160198216X
- ISBN-13: 9781601982162
- Format: 15.6 x 23.4 x 1 cm, minkšti viršeliai
- Language: English English
The Design of Competitive Online Algorithms via a Primal-Dual Approach 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
Reviews