Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

07/16/2020
by   Dimitris Christou, et al.
0

We consider the generalized k-server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of Θ(k!) on their competitive ratio. In particular we show that the Harmonic Algorithm achieves this competitive ratio and provide matching lower bounds. This improves the ≈ 2^2^k doubly-exponential bound of Chiplunkar and Vishwanathan for the more general setting of uniform metrics with different weights.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2018

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

The generalized k-server problem is an extension of the weighted k-serve...
research
02/22/2021

The Randomized Competitive Ratio of Weighted k-server is at least Exponential

The weighted k-server problem is a natural generalization of the k-serve...
research
11/05/2019

Unbounded lower bound for k-server against weak adversaries

We study the resource augmented version of the k-server problem, also kn...
research
11/10/2022

The Randomized k-Server Conjecture is False!

We prove a few new lower bounds on the randomized competitive ratio for ...
research
05/23/2022

The k-Server with Preferences Problem

The famous k-Server Problem covers plenty of resource allocation scenari...
research
10/26/2019

Facility Location Problem in Differential Privacy Model Revisited

In this paper we study the uncapacitated facility location problem in th...
research
01/23/2021

Learning Competitive Equilibria in Noisy Combinatorial Markets

We present a methodology to robustly estimate the competitive equilibria...

Please sign up or login with your details

Forgot password? Click here to reset