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.
By:
Joseph E. Yukich Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Country of Publication: Germany Edition: 7000th 1998 ed. Volume: 1675 Dimensions:
Height: 235mm,
Width: 155mm,
Spine: 8mm
Weight: 530g ISBN:9783540636663 ISBN 10: 3540636668 Series:Lecture Notes in Mathematics Pages: 154 Publication Date:18 March 1998 Audience:
College/higher education
,
Professional and scholarly
,
Professional & Vocational
,
A / AS level
,
Further / Higher Education
Format:Paperback Publisher's Status: Active