List Factoring and Relative Worst Order Analysis

Preprint number: CP3-Origins-2010-41
Authors: Martin R. Ehmsen (University of Southern Denmark), Jens S. Kohrt (CP3-Origins), and Kim S. Larsen (University of Southern Denmark)
External link: arXiv.org

Share this pageShare on FacebookTweet about this on TwitterShare on LinkedInGoogle+

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.