Probability Theory of Classical Euclidean Optimization Problems

Joseph E. Yukich

ISBN 10: 3540636668 / ISBN 13: 9783540636663

Verlag: Springer Berlin Heidelberg Mrz 1998, 1998

Beschreibung

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. Bestandsnummer des Verkäufers 9783540636663

Bibliografische Details

Titel: Probability Theory of Classical Euclidean ...

Verlag: Springer Berlin Heidelberg Mrz 1998

Erscheinungsdatum: 1998

Einband: Taschenbuch

Zustand: Neu

Über diesen Titel

Inhaltsangabe:

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.