000 | 03843nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-68311-7 | ||
003 | DE-He213 | ||
005 | 20240423132546.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540683117 _9978-3-540-68311-7 |
||
024 | 7 |
_a10.1007/BFb0029561 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM043000 _2bisacsh |
|
072 | 7 |
_aUKN _2thema |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aOnline Algorithms _h[electronic resource] : _bThe State of the Art / _cedited by Amos Fiat, Gerhard J. Woeginger. |
250 | _a1st ed. 1998. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
300 |
_aXVIII, 436 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 Computer Science, _x1611-3349 ; _v1442 |
|
505 | 0 | _aCompetitive analysis of algorithms -- Self-organizing data structures -- Competitive analysis of paging -- Metrical task systems, the server problem and the work function algorithm -- Distributed paging -- Competitive analysis of distributed algorithms -- On-line packing and covering problems -- On-line load balancing -- On-line scheduling -- On-line searching and navigation -- On-line network routing -- On-line network optimization problems -- Coloring graphs on-line -- On-Line Algorithms in Machine Learning -- Competitive solutions for on-line financial problems -- On the performance of competitive algorithms in practice -- Competitive odds and ends. | |
520 | _aThis coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area. | ||
650 | 0 | _aComputer networks . | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer programming. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aMathematical optimization. | |
650 | 0 | _aCalculus of variations. | |
650 | 1 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aCalculus of Variations and Optimization. |
700 | 1 |
_aFiat, Amos. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWoeginger, Gerhard J. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540649175 |
776 | 0 | 8 |
_iPrinted edition: _z9783662179291 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1442 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0029561 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189113 _d189113 |