Probabilistic Combinatorial Optimization on Graphs

Preface. Chapter 1. A Short Insight into Probabilistic Combinatorial Optimization. Chapter 2. The Probabilistic Maximum Independent Set. Chapter 3. The Probabilistic Minimum Vertex Cover. Chapter 4. The Probabilistic Longest Path. Chapter 5. Probabilistic Minimum Coloring. Chapter 6. Classification of Probabilistic Graph-problems. Chapter 7. A Compendium of Probabilistic NPO Problems on Graphs. Appendix A. Mathematical Preliminaries. Appendix B. Elements of the Complexity and the Approximation Theory. Bibliography. Index.