menu
{ "item_title" : "Probability Theory of Classical Euclidean Optimization Problems", "item_author" : [" Joseph E. Yukich "], "item_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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/54/063/666/3540636668_b.jpg", "price_data" : { "retail_price" : "49.99", "online_price" : "49.99", "our_price" : "49.99", "club_price" : "49.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Probability Theory of Classical Euclidean Optimization Problems|Joseph E. Yukich

Probability Theory of Classical Euclidean Optimization Problems

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783540636663
  • ISBN-10: 3540636668
  • Publisher: Springer
  • Publish Date: March 1998
  • Dimensions: 9.21 x 6.14 x 0.35 inches
  • Shipping Weight: 0.53 pounds
  • Page Count: 154

Related Categories

You May Also Like...

    1

BAM Customer Reviews