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
Two new Probability inequalities and Concentration Results
Separating subadditive euclidean functionals
On a Square Packing Problem
Asymptotic theory of greedy approximations to minimal k-point random graphs
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
Distribution-Sensitive Construction of the Greedy Spanner
...
1
2
3
4
5
...