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

Naor Joseph (Seffi) Buchbinder Niv

ISBN 10: 160198216X / ISBN 13: 9781601982162

Published by Now Publishers, 2009

About this Item

Print on Demand pp. 192 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Seller Inventory # 95974047

Bibliographic Details

• Title: The Design of Competitive Online Algorithms via a Primal-Dual Approach
• Publisher: Now Publishers
• Publication Date: 2009
• Language: English
• ISBN 10: 160198216X
• ISBN 13: 9781601982162
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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.