On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
Yair BartalElias KoutsoupiasPublished in: STACS (2000)
Keyphrases
- competitive ratio
- dynamic programming
- computational complexity
- simulated annealing
- average case
- lower bound
- expectation maximization
- worst case
- objective function
- learning algorithm
- search space
- np hard
- theoretical analysis
- online algorithms
- search algorithm
- genetic algorithm
- monte carlo
- convergence rate
- solution quality
- search procedure