The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science - Niv Buchbinder - Books - now publishers Inc - 9781601982162 - May 15, 2009
In case cover and title do not match, the title is correct

The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science

Niv Buchbinder

Price
A$ 158.49

Ordered from remote warehouse

Expected delivery Mar 5 - 18

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science

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, graph optimization problems, routing, load balancing, and the problem of allocating ad-auctions.

192 pages

Media Books     Paperback Book   (Book with soft cover and glued back)
Released May 15, 2009
ISBN13 9781601982162
Publishers now publishers Inc
Pages 192
Dimensions 156 × 234 × 10 mm   ·   276 g
Language English  

See all of Niv Buchbinder ( e.g. Paperback Book )