This title provides a comprehensive survey over the subject ofprobabilistic combinatorial optimization, discussing probabilisticversions of some of the most paradigmatic combinatorial problems ongraphs, such as the maximum independent set, the minimum vertexcovering, the longest path and the minimum coloring.
Those who possess a sound knowledge of the subject mater willfind the title of great interest, but those who have only somemathematical familiarity and knowledge about complexity andapproximation theory will also find it an accessible andinformative read.
Cécile Murat
Computer Science Informatik Information Technologies Informationstechnologie Mathematics Mathematik Optimierung Optimization