2011/10/30 by René Sitters, Rene Sitters, Sitters, Rene · 2 citations
Computer Science · Decision Sciences · #68Q25 #68W27 #Advanced Bandit Algorithms Research #Data Structures and Algorithms (cs.DS) #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Optimization and Search Problems #cs.DS #msc:68Q25 #msc:68W27
paper · pdf · doi:10.48550/arxiv.1110.6600
openalex publication_date 2011/10/30 · arxiv created 2013/11/27 · arxiv updated 2013/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The generalized 2-server problem is an online optimization problem where a sequence of requests has to be served at minimal cost. Requests arrive one by one and need to be served instantly by at least one of two servers. We consider the general model where the cost function of the two servers may be different. Formally, each server moves in its own metric space and a request consists of one point in each metric space. It is served by moving one of the two servers to its request point. Requests have to be served without knowledge of the future requests. The objective is to minimize the total traveled distance. The special case where both servers move on the real line is known as the CNN-problem. We show that the generalized work function algorithm is constant competitive for the generalized 2-server problem.