Advertisement

Table of contents

  1. Front Matter
  2. Amos Fiat, Gerhard J. Woeginger
    Pages 1-12
  3. Susanne Albers, Jeffery Westbrook
    Pages 13-51
  4. Sandy Irani
    Pages 52-73
  5. Marek Chrobak, Lawrence L. Larmore
    Pages 74-96
  6. Yair Bartal
    Pages 97-117
  7. János Csirik, Gerhard J. Woeginger
    Pages 147-177
  8. Yossi Azar
    Pages 178-195
  9. JiŘí Sgall
    Pages 196-231
  10. Piotr Berman
    Pages 232-241
  11. Stefano Leonardi
    Pages 242-267
  12. Bala Kalyanasundaram, Kirk Pruhs
    Pages 268-280
  13. Hal A. Kierstead
    Pages 281-305
  14. Avrim Blum
    Pages 306-325
  15. Amos Fiat, Gerhard J. Woeginger
    Pages 385-394
  16. Back Matter

About this book

Introduction

This 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.

Keywords

Distributed Algorithms Online Load Balancing Online Navigation Online Network Routing Online Scheduling algorithm algorithms load balancing online

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0029561
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64917-5
  • Online ISBN 978-3-540-68311-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site