{ "item_title" : "Probabilistic Combinatorial Optimization on Graphs", "item_author" : [" Cécile Murat", "Vangelis Th Paschos "], "item_description" : "This comprehensive survey requires only some mathematical understanding and knowledge about complexity and approximation theory and covers some of the most paradigmatic combinatorial problems on graphs, such as the maximum-independent set, minimum-vertex covering, longest path, and minimum coloring. ", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/1/90/520/933/1905209339_b.jpg", "price_data" : { "retail_price" : "177.95", "online_price" : "177.95", "our_price" : "177.95", "club_price" : "177.95", "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