Probabilistic Methods for Algorithmic Discrete Mathematics (Hardcover, 1998 ed.)

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 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 exploit the structure of the underlying graph; a succinct treatment of randomized algorithms and derandomization techniques.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Algorithms and Combinatorics, 16
Release date:	2001
First published:	1998
Editors:	Michel Habib • Colin McDiarmid • Jorge Ramirez-Alfonsin • Bruce Reed
Dimensions:	234 x 156 x 20mm (L x W x T)
Format:	Hardcover
Pages:	325
Edition:	1998 ed.
ISBN-13:	978-3-540-64622-8
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	3-540-64622-1
Barcode:	9783540646228

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!