{"product_id":"9781601982162","title":"The Design Of Competitive Online Algorithms Via A Primal-Dual Approach","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.","brand":"Now Publishers","offers":[{"title":"Default Title","offer_id":47031204905200,"sku":"9781601982162","price":99.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9781601982162_p0.jpg?v=1763815430","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9781601982162","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}