scientific article; zbMATH DE number 1500547

MaRDI QIDQ4501566zbMATH OpenFDO

Authors Elias Koutsoupias, Yair Bartal

Publication date 13 June 2001

zbMATH Keywords

\(k\)-server problemmetric spacemobile serverson-line algorithmschedulingwork function algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the competitive ratio of the work function algorithm for the k-server problem
• A new upper bound on the work function algorithm for the k-server problem
• On the k -server conjecture
• scientific article; zbMATH DE number 1528669

Cited in

(14)

• Competitive k-server algorithms
• The 2-evader problem
• The 3-server problem in the plane.
• On the competitive ratio of the work function algorithm for the k-server problem
• The work function algorithm for the paging problem
• A new upper bound on the work function algorithm for the k-server problem
• The online \(k\)-server problem with rejection
• An application of various algorithms for solving the k-server problem
• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem
• A fast work function algorithm for solving the k-server problem
• On the k -server conjecture
• scientific article; zbMATH DE number 1528669 (Why is no real title available?)
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• A randomized on–line algorithm for the k–server problem on a line

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501566)