List Factoring and Relative Worst Order Analysis

Martin R. Ehmsen, Jens Svalgaard Kohrt, Kim Skak Larsen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis.
Original languageEnglish
Title of host publicationEighth Workshop on Approximation and Online Algorithms
Number of pages12
Publication date2011
Publication statusPublished - 2011
SeriesLecture Notes in Computer Science

Cite this