Better algorithms for unfair metrical task systems and applications

DOI10.1145/335305.335408zbMath1296.68189OpenAlexW1990636890MaRDI QIDQ3192047

Manor Mendel, Amos Fiat

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (5)

Nested convex bodies are chaseable ⋮ Parametrized Metrical Task Systems ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ A randomized on–line algorithm for the k–server problem on a line ⋮ A general decomposition theorem for the \(k\)-server problem

This page was built for publication: Better algorithms for unfair metrical task systems and applications