This book is not available in our subscription service
This book is not yet available in our subscription service due to
restrictions in our agreements with the publisher. We hope to be able
to offer this title in our subscription service as soon as possible. In the meantime you can purchase this book individually.
Probabilistic Combinatorial Optimization on Graphs
Availability for Probabilistic Combinatorial Optimization on Graphs
Available as a separate purchase
About the book
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.