Sciweavers

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

28

STACS
2000
Springer

favoriteEmaildiscussreport

97views Theoretical Computer Science» more STACS 2000»

On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem

14 years 2 months ago

On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem

Download cgi.di.uoa.gr

The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total mileage. The k-server conjecture of Manasse, McGeogh, and Sleator states that there exists a k-competitive online algorithm. The conjecture has been open for over 15 years. The top candidate online algorithm for settling this conjecture is the Work Function Algorithm (wfa) which was shown to have competitive

Yair Bartal, Elias Koutsoupias

Real-time Traffic

Conjecture | Fundamental Online Problems | Online Algorithm | STACS 2000 | Theoretical Computer Science |

claim paper

Related Content

» On the Advice Complexity of the kServer Problem

» Lower Bounds for Randomized kServer and Motion Planning Algorithms

» On the additive constant of the kserver Work Function Algorithm

» The relative worstorder ratio applied to paging

» Online Bin Packing with Cardinality Constraints

» Randomized Competitive Algorithms for Generalized Caching

» Competitive Analysis of Online Price Discount Replacement Problem

» Resource augmentation for weighted flowtime explained by dual fitting

» On Quadratic Programming with a Ratio Objective

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	STACS
Authors	Yair Bartal, Elias Koutsoupias

Comments (0)