Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007784519/catalog> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b10770184.
- catalog created "1998.".
- catalog date "1998".
- catalog date "1998.".
- catalog dateCopyrighted "1998.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Introduction -- Subadditivity and Superadditivity -- Subadditive and Superaddititive 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 -- Geometrics Location Problems -- Worst Case Growth Rates -- Bibliography -- Index.".
- catalog description "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.".
- catalog extent "x, 152 p. :".
- catalog hasFormat "Probability theory of classical Euclidean optimization problems.".
- catalog identifier "3540636668 (softcover : alk. paper)".
- catalog isFormatOf "Probability theory of classical Euclidean optimization problems.".
- catalog isPartOf "Lecture notes in mathematics (Springer-Verlag) ; 1675.".
- catalog isPartOf "Lecture notes in mathematics, 0075-8434 ; 1675".
- catalog issued "1998".
- catalog issued "1998.".
- catalog language "eng".
- catalog publisher "New York : Springer,".
- catalog relation "Probability theory of classical Euclidean optimization problems.".
- catalog subject "510 s 519.2 21".
- catalog subject "Combinatorial probabilities.".
- catalog subject "Distribution (Probability theory).".
- catalog subject "Mathematical optimization.".
- catalog subject "Mathematics.".
- catalog subject "QA3 L28 no. 1675 QA273.45".
- catalog subject "Random graphs.".
- catalog subject "Stochastic geometry.".
- catalog tableOfContents "Introduction -- Subadditivity and Superadditivity -- Subadditive and Superaddititive 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 -- Geometrics Location Problems -- Worst Case Growth Rates -- Bibliography -- Index.".
- catalog title "Probability theory of classical Euclidean optimization problems / Joseph E. Yukich.".
- catalog type "text".