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.
Product Identifiers
Publisher
Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
ISBN-13
9783540636663
eBay Product ID (ePID)
95990939
Product Key Features
Author
Joseph E. Yukich
Publication Name
Probability Theory of Classical Euclidean Optimization Problems
Format
Paperback
Language
English
Subject
Mathematics
Publication Year
1998
Type
Textbook
Number of Pages
154 Pages
Dimensions
Item Height
235mm
Item Width
155mm
Volume
1675
Item Weight
530g
Additional Product Features
Title_Author
Joseph E. Yukich
Series Title
Lecture Notes in Mathematics
Country/Region of Manufacture
Germany
Best Selling in Adult Learning & University
Current slide {CURRENT_SLIDE} of {TOTAL_SLIDES}- Best Selling in Adult Learning & University