Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Amos Fiat, Gerhard J. Woeginger, editors, Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996). Volume 1442 of Lecture Notes in Computer Science, Springer, 1998.

Conference: Dagstuhl1998

Abstract is missing.

Competitive Analysis of AlgorithmsAmos Fiat, Gerhard J. Woeginger. 1-12

Self-Organizing Data StructuresSusanne Albers, Jeffery Westbrook. 13-51

Competitive Analysis of PagingSandy Irani. 52-73

Metrical Task Systems, the Server Problem and the Work Function AlgorithmMarek Chrobak, Lawrence L. Larmore. 74-96

Distributed PagingYair Bartal. 97-117

Competitive Analysis of Distributed AlgorithmsJames Aspnes. 118-146

On-line Packing and Covering ProblemsJános Csirik, Gerhard J. Woeginger. 147-177

On-line Load BalancingYossi Azar. 178-195

On-line SchedulingJiri Sgall. 196-231

On-line Searching and NavigationPiotr Berman. 232-241

On-line Network RoutingStefano Leonardi. 242-267

On-line Network Optimization ProblemsBala Kalyanasundaram, Kirk Pruhs. 268-280

Coloring Graphs On-lineHal A. Kierstead. 281-305

On-line Algorithms in Machine LearningAvrim Blum. 306-325

Competitive Solutions for On-line Financial ProblemsRan El-Yaniv. 326-372

On the Performance of Competitive Algorithms in PracticeAnna R. Karlin. 373-384

Competitive Odds and EndsAmos Fiat, Gerhard J. Woeginger. 385-394

Bibliography on Competitive AlgorithmsMarek Chrobak, John Noga. 395-436

runs on WebDSL