• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Probability Theory of Classical Euclidean Optimization Problems

Probability Theory of Classical Euclidean Optimization Problems

Paperback

Series: Lecture Notes in Mathematics, Book 1675

GeometryProbability & Statistics

ISBN10: 3540636668
ISBN13: 9783540636663
Publisher: Springer Nature
Published: Mar 18 1998
Pages: 154
Weight: 0.53
Height: 0.35 Width: 6.14 Depth: 9.21
Language: English
This monograph describes the stochastic behavior of the solutions to the classic problems of Euclidean combinatorial optimization, computational geometry, and operations research. Using two-sided additivity and isoperimetry, it formulates general methods describing the total edge length of random graphs in Euclidean space. The approach furnishes strong laws of large numbers, large deviations, and rates of convergence for solutions to the random versions of various classic optimization problems, including the traveling salesman, minimal spanning tree, minimal matching, minimal triangulation, two-factor, and k-median problems. Essentially self-contained, this monograph may be read by probabilists, combinatorialists, graph theorists, and theoretical computer scientists.

Also in

Probability & Statistics