𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic methods for algorithmic discrete mathematics

✍ Scribed by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed

Book ID
127425290
Publisher
Springer
Year
1998
Tongue
English
Weight
4 MB
Series
Algorithms and Combinatorics
Edition
1
Category
Library
ISBN
3540646221

No coin nor oath required. For personal study only.

✦ Synopsis

The book gives an accessible account of modern probabilistic methodsfor analyzing combinatorial structures and algorithms. It will be anuseful guide for graduate students and researchers. Special featuresincluded: a simple treatment of Talagrand's inequalities and theirapplications; an overview and many carefully worked out examples ofthe probabilistic analysis of combinatorial algorithms; a discussionof the "exact simulation" algorithm (in the context of Markov ChainMonte Carlo Methods); a general method for finding asymptoticallyoptimal or near optimal graph colouring, showing how theprobabilistic method may be fine-tuned to exploit the structure ofthe underlying graph; a succinct treatment of randomized algorithmsand derandomization techniques.

πŸ“œ SIMILAR VOLUMES

Probabilistic methods for algorithmic di
Probabilistic methods for algorithmic discrete mathematics
✍ Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed πŸ“‚ Library πŸ“… 1998 πŸ› Springer 🌐 English βš– 2 MB

The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers. Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview

Discrete mathematics with algorithms
Discrete mathematics with algorithms
✍ Michael O. Albertson, Joan P. Hutchinson πŸ“‚ Library πŸ“… 1988 πŸ› Wiley 🌐 English βš– 3 MB

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic p

Combinatorial methods in discrete mathem
Combinatorial methods in discrete mathematics
✍ Vladimir N. Sachkov, V. Kolchin πŸ“‚ Library πŸ“… 1996 🌐 English βš– 2 MB

This is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A dis