che-chandler.de
|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
Probabilistic Combinatorial Optimization on Graphs
ISBN-13:
9781118614136
Veröffentl:
2013
Einband:
E-Book
Seiten:
268
Autor:
Cécile Murat
eBook Typ:
EPUB
eBook Format:
Reflowable E-Book
Kopierschutz:
Adobe DRM [Hard-DRM]
Sprache:
Englisch
Beschreibung:
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.
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.
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.