Cantitate/Preț
Produs

The Design of Competitive Online Algorithms Via a Primal-Dual Approach: Foundations and Trends(r) in Theoretical Computer Science, cartea 10

Autor Niv Buchbinder, Joseph (Seffi) Naor
en Limba Engleză Paperback – 30 apr 2009
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
Citește tot Restrânge

Din seria Foundations and Trends(r) in Theoretical Computer Science

Preț: 51518 lei

Preț vechi: 64398 lei
-20% Nou

Puncte Express: 773

Preț estimativ în valută:
9859 10215$ 8228£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781601982162
ISBN-10: 160198216X
Pagini: 192
Dimensiuni: 156 x 234 x 10 mm
Greutate: 0.28 kg
Editura: Now Publishers
Seriile Foundations and Trends in Theoretical Computer Science, Foundations and Trends(r) in Theoretical Computer Science

Locul publicării:United States