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.
"synopsis" may belong to another edition of this title.
US$ 18.60 shipping from Germany to U.S.A.
Destination, rates & speedsSeller: Antiquariat Bookfarm, Löbnitz, Germany
Softcover. x, 152 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04553 9783540636663 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2490789
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:9783540636663. Seller Inventory # 4136422
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5905496-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020173079
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540636663
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783540636663
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540636663_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 5905496-n
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 164 pp. Englisch. Seller Inventory # 9783540636663
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540636663
Quantity: 1 available