scientific article; zbMATH DE number 65696

MaRDI QIDQ4010307zbMATH OpenFDO

Authors Edward F. Grove

Publication date 27 September 1992

zbMATH Keywords

competitivenessonline \(K\)-server

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• The harmonic k -server algorithm is competitive
• Competitive \(k\)-server algorithms
• A randomized on–line algorithm for the k–server problem on a line
• On online algorithms with advice for the \(k\)-server problem
• On online algorithms with advice for the \(k\)-server problem
• A primal-dual online algorithm for the k-server problem on weighted HSTs
• An Optimal On-Line Algorithm for K Servers on Trees
• The fast algorithm for online \(k\)-server problem on trees
• Competitive algorithms for generalized \(k\)-server in uniform metrics
• Competitive Algorithms for Generalized k -Server in Uniform Metrics

Cited in

(4)

• On convex body chasing
• HARMONIC is 3-competitive for two servers
• Competitive algorithms for the weighted server problem
• Dynamic location problems with limited look-ahead

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 Q4010307)