A new upper bound on the work function algorithm for the k-server problem.
Wenming ZhangYongxi ChengPublished in: J. Comb. Optim. (2020)
Keyphrases
- worst case
- upper bound
- times faster
- learning algorithm
- computational cost
- matching algorithm
- error probability
- optimization algorithm
- experimental evaluation
- dynamic programming
- np hard
- improved algorithm
- tree structure
- recognition algorithm
- neural network
- lower bound
- linear programming
- path planning
- preprocessing
- database
- clustering algorithm
- detection algorithm
- computationally efficient
- search space
- k means
- significant improvement
- cost function