Couverture : Open Library
Résumé
The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques
Détails de l'édition
- ISBN-13
- 9783540646228
- ISBN-10
- 3540646221
- EAN
- 9783540646228
- Éditeur
- Springer (Berlin)
- Date de publication
- 19 août 1998
- Langue
- en
- Pages
- 346
- Dimensions
- 24 cm
Provenance des données
- dimensions BnF Catalogue général · 23 juillet 2026
- language Google Books · 4 novembre 2026
- page_count Google Books · 4 novembre 2026
- publication_date Google Books · 4 novembre 2026
- summary Google Books · 4 novembre 2026
- title Google Books · 4 novembre 2026