Probabilistic Methods for Algorithmic Discrete Mathematics
Author | : Michel Habib |
Publisher | : Springer Science & Business Media |
Total Pages | : 346 |
Release | : 1998-08-19 |
ISBN-10 | : 3540646221 |
ISBN-13 | : 9783540646228 |
Rating | : 4/5 (228 Downloads) |
Download or read book Probabilistic Methods for Algorithmic Discrete Mathematics written by Michel Habib and published by Springer Science & Business Media. This book was released on 1998-08-19 with total page 346 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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