000 | 02799nam a22004815i 4500 | ||
---|---|---|---|
001 | 978-3-540-69627-8 | ||
003 | DE-He213 | ||
005 | 20160624101833.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540696278 _9978-3-540-69627-8 |
||
024 | 7 |
_a10.1007/BFb0093472 _2doi |
|
050 | 4 | _aQA273.A1-274.9 | |
050 | 4 | _aQA274-274.9 | |
072 | 7 |
_aPBT _2bicssc |
|
072 | 7 |
_aPBWL _2bicssc |
|
072 | 7 |
_aMAT029000 _2bisacsh |
|
082 | 0 | 4 |
_a519.2 _223 |
100 | 1 |
_aYukich, Joseph E. _eauthor. |
|
245 | 1 | 0 |
_aProbability Theory of Classical Euclidean Optimization Problems _h[electronic resource] / _cby Joseph E. Yukich. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
300 |
_aX, 154 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1675 |
|
505 | 0 | _aSubadditivity and superadditivity -- Subadditive and superadditive 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 -- Geometric location problems -- Worst case growth rates. | |
520 | _aThis 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. | ||
650 | 0 | _aMathematics. | |
650 | 0 | _aDistribution (Probability theory). | |
650 | 1 | 4 | _aMathematics. |
650 | 2 | 4 | _aProbability Theory and Stochastic Processes. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540636663 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1675 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0093472 |
942 |
_2EBK1817 _cEBK |
||
999 |
_c31111 _d31111 |