On the Partitioning Algorithm

  Béla Csaba 1    

  Acta Cybernetica 14 (1999) 217-227.

Abstract:

 We consider the deterministic and the randomized paging problem. We show the close connection between the partitioning algorithm of McGeoch and Sleator and the OPT graph of the problem via a natural framework. This allows us to prove some important properties of the "deterministic" partitioning algorithm. As a consequence of these we prove, that it is a k -competitive deterministic on-line algorithm. Besides, we show an application of the OPT graph for a special case of the k -server problem.  

Footnotes

  1  Department of Computer Science; Rutgers, The State University of NJ; 110 Frelinghuysen Road; Piscataway, NJ 08854-8019 USA. Email: bcsaba@paul.rutgers.edu