Probability Theory of Classical Euclidean Optimization Problems
This monograph describes the shastic 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.
1101496454
Probability Theory of Classical Euclidean Optimization Problems
This monograph describes the shastic 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.
49.99 In Stock
Probability Theory of Classical Euclidean Optimization Problems

Probability Theory of Classical Euclidean Optimization Problems

by Joseph E. Yukich
Probability Theory of Classical Euclidean Optimization Problems

Probability Theory of Classical Euclidean Optimization Problems

by Joseph E. Yukich

Paperback(1998)

$49.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Unavailable at Glendora.

Related collections and offers


Overview

This monograph describes the shastic 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.

Product Details

ISBN-13: 9783540636663
Publisher: Springer Berlin Heidelberg
Publication date: 04/24/1998
Series: Lecture Notes in Mathematics , #1675
Edition description: 1998
Pages: 154
Product dimensions: 6.10(w) x 9.25(h) x 0.01(d)
From the B&N Reads Blog

Customer Reviews