Probabilistic Combinatorial Optimization on Graphs (eBook)

Cécile Murat is Assistant Professor of Computer Science at the University of Paris-Dauphine. Her research interests include combinatorial and probabilistic combinatorial optimization, the design and analysis of efficient algorithms and the design of efficient solutions for hard combinatorial optimization problems. She is the author of over 20 research papers. Vangelis Th. Paschos is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.

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.