Edición de la obra Probabilistic Methods for Algorithmic Discrete Mathematics
| Autor | Michel Habib |
|---|---|
| Editorial | Springer Berlin Heidelberg |
| Fecha de publicación | 1998 |
| Lugar | Berlin, Heidelberg |
| Idioma | inglés |
| Páginas | 325 |
| Formato | [electronic resource] / |
| ISBN-13 | 9783642084263, 9783662127889 |
| ISBN-10 | 3642084265, 3662127881 |
| OCLC | 851371966 |
| Serie | Algorithms and Combinatorics -- 16 · Algorithms and Combinatorics -- 16 |
| Número de Cutter | H116p |
|---|
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.