- List Factoring and Relative Worst Order Analysis.
- Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Algorithmica, 66(2): 287-309, 2013.
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.
As the first contribution, it adds the static list
accessing problem to the collection of online problems where
relative worst order analysis gives better results.
List accessing is a classic data structuring problem of
maintaining optimal ordering in a linked list.
It is also one of the classic problems in online algorithms,
in that it is used as a model problem, along with paging
and a few other problems, when trying out new techniques
and quality measures.
As the second contribution,
this paper adds the non-trivial supplementary proof technique of
list factoring to the theoretical toolbox for
relative worst order analysis.
List factoring is perhaps the most successful technique for
analyzing list accessing algorithms,
reducing the complexity of the analysis of algorithms on
full-length lists to lists of length two.
- 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.
open access (232 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.
Other publications by the author.