Shopping Cart
You're getting the VIP treatment!
With the purchase of Kobo VIP Membership, you're getting 10% off and 2x Kobo Super Points on eligible items.
itemsitem
With the purchase of Kobo VIP Membership, you're getting 10% off and 2x Kobo Super Points on eligible items.
You'll see how many points you'll earn before checking out. We'll award them after completing your purchase.
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
You can read this item using any of the following Kobo apps and devices: