On the additive constant of the κ-server work function algorithm

Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers
Pages128-134
Number of pages7
DOIs
StatePublished - 2009
Externally publishedYes
Event7th Workshop on Approximation and Online Algorithms, WAOA 2009 - Copenhagen, Denmark
Duration: 10 Sep 200911 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5893 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th Workshop on Approximation and Online Algorithms, WAOA 2009
Country/TerritoryDenmark
CityCopenhagen
Period10/09/0911/09/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the additive constant of the κ-server work function algorithm'. Together they form a unique fingerprint.

Cite this