T-Theory Applications to Online Algorithms for the Server Problem
Data Structures and Algorithms
2007-05-23 v1 Discrete Mathematics
Abstract
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the development of several online algorithms for the k-server problem. A brief summary of the k-server problem, and some important application concepts of T-theory, are given. Additionally, a number of known k-server results are restated using the established terminology of T-theory. Lastly, a previously unpublished 3-competitiveness proof, using T-theory, for the Harmonic algorithm for two servers is presented.
Cite
@article{arxiv.cs/0611088,
title = {T-Theory Applications to Online Algorithms for the Server Problem},
author = {Lawrence L. Larmore and James A. Oravec},
journal= {arXiv preprint arXiv:cs/0611088},
year = {2007}
}
Comments
19 figures 38 pages