ENGLISH

Probability theory and combinatorial optimization

By J Michael Steele

Book information

Publisher
Society for Industrial and Applied Mathematics
Year
1997
ISBN
0-89871-380-3, 9780898713800
Language
english
Format
DJVU
Filesize
2 MB (1944755 bytes)
Series
CBMS-NSF regional conference series in applied mathematics, 69
Pages
viii, 159 p. : ill. ; 26 cm\170
Library
kolxo3
DPI
300
Time added
2014-11-04 21:00:00

Description

This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal 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

Similar books