Get Free Shipping on orders over $79
Probability Theory and Combinatorial Optimization : C B M S - N S F REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS - J. Michael Steele

Probability Theory and Combinatorial Optimization

By: J. Michael Steele

Paperback | 31 December 1997

At a Glance

Paperback


$168.75

or 4 interest-free payments of $42.19 with

 or 

Ships in 10 to 15 business days

This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. Much attention is paid to those questions dealing with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles.

There are three fundamental probabilistic themes that are examined through our concrete investigations. First, there is a systematic exploitation of martingales. Over the last ten years, many investigators of problems of combinatorial optimization have come to count on martingale inequalities as versatile tools which let us show that many of the naturally occurring random variables of combinatorial optimization are sharply concentrated about their means - a phenomenon with numerous practical and theoretical consequences.

The second theme that is explored is the systematic use of subadditivity of several flavors, ranging from the naïve subadditivity of real sequences to the subtler subadditivity of stochastic processes. By and large, subadditivity offers only elementary tools, but on remarkably many occasions such tools provide the key organizing principle in the attack on problems of nearly intractable difficulty.

The third and deepest theme developed here concerns the application of Talagrand's isoperimetric theory of concentration inequalities. This new theory is reshaping almost everything that is known in the probability theory of combinatorial optimization. The treatment given here deals with only a small part of Talagrand's theory, but the reader will find considerable coaching on how to use some of the most important ideas from that theory.

More in Mathematics

Speed : How it Explains the World - Vaclav Smil

RRP $36.99

$29.75

20%
OFF
The Infinite Game : From the bestselling author of Start With Why - Simon Sinek
Primary Mathematics : 4th Edition - Integrating Theory with Practice - Penelope Baker
The Art of Gathering : How We Meet and Why It Matters - Priya Parker
Collins Classics - The Republic : Collins Classics - Plato
The Maths Book : Big Ideas Simply Explained - DK

RRP $42.99

$32.99

23%
OFF
How to Win At Chess : The Ultimate Guide for Beginners and Beyond - Levy Rozman
The Selfish Gene : 40th Anniversary Edition - Richard Dawkins

RRP $32.95

$26.99

18%
OFF
The Mending of Broken Bones : A Modern Guide to Classical Algebra - Paul Lockhart
Geometry : Grades 6 - 8 - Kumon Publishing

RRP $24.99

$18.75

25%
OFF
Grade 3 Geometry and Measurement - KUMON PUBLISHING

RRP $16.99

$13.75

19%
OFF