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've already shared your review for this item. Thanks!
We are currently reviewing your submission. Thanks!
Probabilistic Combinatorial Optimization on Graphs
by Vangelis Th. Paschos,Cécile Murat
Tell readers what you thought by rating and reviewing this book.
Please make sure to choose a rating
How to write a great review
(0) 50 characters minimum
The review must be at least 50 characters long.
The title should be at least 4 characters long.
Your display name should be at least 2 characters long.
At Kobo, we try to ensure that published reviews do not contain rude or profane language, spoilers, or any of our reviewer's personal information.
Would you like us to take another look at this review?
You've successfully reported this review. We appreciate your feedback.
Probabilistic Combinatorial Optimization on Graphs
by Vangelis Th. Paschos,Cécile Murat
You submitted the following rating and review. We'll publish them on our site once we've reviewed them.
by on September 28, 2016
You can read this item using any of the following Kobo apps and devices: