AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
On-line Algorithms
About this Title
Lyle A. McGeoch and Daniel D. Sleator, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1992; Volume 7
ISBNs: 978-0-8218-6596-5 (print); 978-1-4704-3965-1 (online)
DOI: https://doi.org/10.1090/dimacs/007
MathSciNet review: MR1165341
MSC: Primary 68-06
Table of Contents
Front/Back Matter
Chapters
- A graph-theoretic game and its application to the $k$-server problem (extended abstract)
- The server problem and on-line games
- The harmonic online $K$-server algorithm is competitive
- The $K$-server dual and loose competitiveness for paging
- A statistical adversary for on-line algorithms
- On-line graph coloring
- Online weighted matching
- On the competitiveness of splay trees: Relations to the union-find problem
- Competitive group testing
- Randomized algorithms for multiprocessor page migration
- Navigating in unfamiliar geometric terrain (extended summary)
- Visual searching and mapping
- Scheduling parallel machines on-line
- Competitive paging with locality of reference (brief summary)
- Lower bounds for on-line graph coloring