Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IPL
2010

favoriteEmaildiscussreport

69views more IPL 2010»

On the additive constant of the k-server Work Function Algorithm

13 years 3 months ago

On the additive constant of the k-server Work Function Algorithm

Download www.eng.tau.ac.il

We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. As a consequence of [3] this also shows that the Work Function algorithm is strictly (4k − 2)competitive.

Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Ro

Real-time Traffic

Competitive | IPL 2010 | K-server Problem | Work Function Algorithm |

claim paper

Related Content

» On the Competitive Ratio of the Work Function Algorithm for the kServer Problem

» On the Advice Complexity of the kServer Problem

» Bayesian Regression of Piecewise Constant Functions

» Discovering additive structure in black box functions

» Storing a Compressed Function with Constant Time Access

» Real Royal Road Functions for Constant Population Size

» BottomUp Multiple Row Addition Algorithms for the BiclusteringProblem

» Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

» Constant Depth Circuits Fourier Transform and Learnability

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	IPL
Authors	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén

Comments (0)