Polynomial-time Algorithm for Distributed Server Allocation Problem
Takaaki Sawa, Fujun He, Akio Kawabata, Eiji Oki · 2019
This paper proposes an algorithm for the distributed server allocation problem, namely Minimizing the Maximum Delay (MMD), where an optimal solution is obtained when all server-server delays are the same constant value. We prove that MMD obtains an optimal solution with the polynomial time complexity.