- List Factoring and Relative Worst Order Analysis.
- Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
In 8th Workshop on Approximation and Online Algorithms (WAOA), volume 6534 of Lecture Notes in Computer Science, pages 118-129. Springer, 2011.
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.
- Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any):
The final publication is available at link.springer.com.
Link to the journal version containing all the material and proofs, some of which are usually omitted in the conference version due to space constraints.
Other publications by the author.