# Probability theory and combinatorial optimization

@inproceedings{Steele1987ProbabilityTA, title={Probability theory and combinatorial optimization}, author={J. Steele}, year={1987} }

Preface 1. First View of Problems and Methods. A first example. Long common subsequences Subadditivity and expected values Azuma's inequality and a first application A second example. The increasing-subsequence problem Flipping Azuma's inequality Concentration on rates Dynamic programming Kingman's subadditive ergodic theorem Observations on subadditive subsequences Additional notes 2. Concentration of Measure and the Classical Theorems. The TSP and quick application of Azuma's inequality Easy… Expand

#### 405 Citations

On a Square Packing Problem

- Computer Science, Mathematics
- Combinatorics, Probability and Computing
- 2002

Asymptotic theory of greedy approximations to minimal k-point random graphs

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1999

Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds

- Mathematics, Computer Science
- SIAM J. Optim.
- 2004

Concentration of Measure Inequalities in Information Theory, Communications, and Coding

- Computer Science, Mathematics
- Found. Trends Commun. Inf. Theory
- 2013

Concentration of Measure for the Analysis of Randomized Algorithms

- Computer Science, Mathematics
- 2009

Distribution-Sensitive Construction of the Greedy Spanner

- Computer Science, Mathematics
- Algorithmica
- 2016

RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS

- Physics, Mathematics
- 2018