The Design of Competitive Online Algorithms via a Primal-Dual Approach (Paperback) (ISBN-13: 9781601982162)

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

Author: Niv Buchbinder, Joseph (Seffi) Naor
ISBN-10: 160198216X
ISBN-13: 9781601982162
Publisher: Now Publishers
Language: English
Published: 05/11/2009
Pages: 192
Format: Paperback
Weight: 0.61lbs
Size: 9.21h x 6.14w x 0.41d