Online algorithms : the state of the art
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 e...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
1442 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Online algorithms, the state of the art, Amos Fiat, Gerhard J. Woeginger (eds.), 1998, New York, Springer, 1 vol. (XVIII-436 p.), Lecture notes in computer science, 3-540-64917-4 • Online Algorithms, Texte imprimé, 9783662179291 |
Sumário:
- Competitive 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.