On the Advice Complexity of the k-server Problem Under Sparse Metrics
- 20 August 2015
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 59 (3) , 476-499
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Compact and low delay routing labeling scheme for Unit Disk GraphsComputational Geometry, 2012
- Online computation with adviceTheoretical Computer Science, 2011
- A randomized algorithm for two servers in cross polytope spacesTheoretical Computer Science, 2011
- On the competitive ratio of the work function algorithm for the k-server problemTheoretical Computer Science, 2004
- Solution of a problem in DNA computingTheoretical Computer Science, 2002
- On the k -server conjectureJournal of the ACM, 1995
- Competitive randomized algorithms for nonuniform problemsAlgorithmica, 1994
- Random walks on weighted graphs and applications to on-line algorithmsJournal of the ACM, 1993
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- S-functions for graphsJournal of Geometry, 1976