Probability theory of classical Euclidean optimization problems (Q1385435)

The monograph aims to develop the probability theory of solutions to the classical problems in Euclidean combinatorial optimization, computational geometry, and operations research. These problems are associated with graphs and the chief goal is to describe the almost sure behavior of the total edge lengths of these graphs. The book consists of the following chapters: 1. Introduction. 2. Subadditivity and superadditivity. 3. Subadditive and superadditive Euclidean functionals. 4. Asymptotics for Euclidean functionals: The uniform case. 5. Rates of convergence and heuristics. 6. Isoperimetry and concentration inequalities. 7. Umbrella theorems for Euclidean functionals. 8. Applications and examples. 9. Minimal triangulations. 10. Geometric location problems. 11. Worst case growth rates.