The Harmonic Online k-Server Algorithm Is Poly(k)-CompetitiveResearch Paper
The online k-server problem concerns mobile servers that must answer requests without knowing future requests. Moving a server costs the distance it travels. A decision rule can achieve a strong comparison with other service schedules while still requiring substantial computation or memory to make each decision. Harmonic addresses the computational side…