T-Theory Applications to Online Algorithms for the Server Problem

Simple item page
dc.creatorLarmore, Lawrence L.
dc.creatorOravec, James A.
dc.date2006-11-18
dc.date.accessioned2026-07-07T07:31:44Z
dc.date.available2026-07-07T07:31:44Z
dc.descriptionAlthough 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.
dc.description19 figures 38 pages
dc.identifierhttps://arxiv.org/abs/cs/0611088
dc.identifierhttp://arxiv.org/abs/cs/0611088
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118859
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.titleT-Theory Applications to Online Algorithms for the Server Problem
dc.typetext

Files

Collections

arXiv