An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem.

Published in: CoRR (2015)

Keyphrases

randomized algorithm
lower bound
competitive ratio
greedy algorithm
worst case
log log
upper bound
average case
randomized algorithms
single machine
branch and bound algorithm
online algorithms
optimal strategy
objective function
convergence rate
closest string
optimal solution
perceptron algorithm