{ "item_title" : "Approximation Algorithms", "item_author" : [" Vijay V. Vazirani "], "item_description" : "This monograph deals with designing polynomial time approximation algorithms for NP-hard combinatorial optimization problems. Although NP-complete problems do not offer footholds to find optimal solutions efficiently, they offer footholds to find near-optimal solutions efficiently. Designing polynomial time algorithms involves finding these footholds and exploiting them. The book discusses a wide range of combinatorial and LP-based algorithms in detail.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/54/065/367/3540653678_b.jpg", "price_data" : { "retail_price" : "99.00", "online_price" : "99.00", "our_price" : "99.00", "club_price" : "99.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details