Probability theory of classical Euclidean optimization problems (Q1385435): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFb0093472 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Oleg K. Zakusilo / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Oleg K. Zakusilo / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0093472 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1489238841 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFB0093472 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:16, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probability theory of classical Euclidean optimization problems |
scientific article |
Statements
Probability theory of classical Euclidean optimization problems (English)
0 references
27 April 1998
0 references
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.
0 references
