Probabilistic Methods for Algorithmic Discrete Mathematics

Author:   Michel Habib ,  Colin McDiarmid ,  Jorge Ramirez-Alfonsin ,  Bruce Reed
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1998 ed.
Volume:   16
ISBN:  

9783540646228


Pages:   325
Publication Date:   19 August 1998
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $514.80 Quantity:  
Add to Cart

Share |

Probabilistic Methods for Algorithmic Discrete Mathematics


Add your own review!

Overview

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.

Full Product Details

Author:   Michel Habib ,  Colin McDiarmid ,  Jorge Ramirez-Alfonsin ,  Bruce Reed
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1998 ed.
Volume:   16
Dimensions:   Width: 15.60cm , Height: 2.00cm , Length: 23.40cm
Weight:   1.470kg
ISBN:  

9783540646228


ISBN 10:   3540646221
Pages:   325
Publication Date:   19 August 1998
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

The Probabilistic Method.- Probabilistic Analysis of Algorithms.- An Overview of Randomized Algorithms.- Mathematical Foundations of the Markov Chain Monte Carlo Method.- Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems.- Concentration.- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms.- Author Index.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List