Computer Science – Data Structures and Algorithms
Scientific paper
2010-09-29
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Ehmsen Martin R.
Kohrt Jens S.
Larsen Kim S.
No associations
LandOfFree
List Factoring and Relative Worst Order Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with List Factoring and Relative Worst Order Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List Factoring and Relative Worst Order Analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-522929