Free Delivery Over $100
|
|
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Joseph E. YukichPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 7000th 1998 ed. Volume: 1675 Dimensions: Width: 15.50cm , Height: 0.80cm , Length: 23.50cm Weight: 0.530kg ISBN: 9783540636663ISBN 10: 3540636668 Pages: 154 Publication Date: 18 March 1998 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: Out of print, replaced by POD  We will order this item for you from a manufatured on demand supplier. Table of ContentsSubadditivity and superadditivity.- Subadditive and superadditive euclidean functionals.- Asymptotics for euclidean functionals: The uniform case.- Rates of convergence and heuristics.- Isoperimetry and concentration inequalities.- Umbrella theorems for euclidean functionals.- Applications and examples.- Minimal triangulations.- Geometric location problems.- Worst case growth rates.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
