| 000 | a | ||
|---|---|---|---|
| 999 |
_c33866 _d33866 |
||
| 008 | 250424b xxu||||| |||| 00| 0 eng d | ||
| 020 | _a9783540649175 | ||
| 082 |
_a005.1 _bFIA |
||
| 100 |
_aFiat, Amos _eed. |
||
| 245 | _aOnline algorithms : the state of the art | ||
| 260 |
_bSpringer, _c1998 _aNew York : |
||
| 300 |
_axviii, 436 p. ; _bill. (some col.), _c24 cm. |
||
| 365 |
_b79.99 _c€ _d97.70 |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 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 | _aDistributed Algorithms | ||
| 650 | _aOnline Load Balancing | ||
| 650 | _aOnline Network Routing | ||
| 650 | _aOnline Navigation | ||
| 650 | _aOnline Scheduling | ||
| 650 | _aLoad balancing | ||
| 650 | _aAlgorithm analysis | ||
| 650 | _aProblem complexity | ||
| 700 |
_aWoeginger, Gerhard _eed. |
||
| 942 |
_2ddc _cBK |
||