A new upper bound on the work function algorithm for the k-server problem

The k -server problem was introduced by Manasse et al. (in: Proceedings of the 20th annual ACM symposium on theory of computing, Chicago, Illinois, USA, pp 322–333, 1988), and is one of the most famous and well-studied online problems. Koutsoupias and Papadimitriou (J ACM 42(5):971–983, 1995) showed...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 39; no. 2; pp. 509 - 518
Main Authors:	Zhang, Wenming, Cheng, Yongxi
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2020 Springer Nature B.V
Subjects:	Algorithms Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Metric space Operations Research/Decision Theory Optimization Theory of Computation Upper bounds Work functions Work function server problem Competitive analysis On-line algorithms
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!