The generalized two-server problem

DOI10.1145/1147954.1147960zbMath1326.68338OpenAlexW2154641120MaRDI QIDQ3546319

Leen Stougie, R. A. Sitters

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1147954.1147960

zbMATH Keywords

competitive analysisonline algorithms\(k\)-server problemwork functionmetrical service system

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ Nested convex bodies are chaseable ⋮ Online chasing problems for regular polygons ⋮ A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem ⋮ Memoryless algorithms for the generalized k-server problem on uniform metrics

This page was built for publication: The generalized two-server problem