Computer Science – Data Structures and Algorithms
Scientific paper
2006-11-18
Computer Science
Data Structures and Algorithms
19 figures 38 pages
Scientific paper
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.
Larmore Lawrence L.
Oravec James A.
No associations
LandOfFree
T-Theory Applications to Online Algorithms for the Server Problem 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 T-Theory Applications to Online Algorithms for the Server Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and T-Theory Applications to Online Algorithms for the Server Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-674220