Better algorithms for unfair metrical task systems and applications

DOI10.1145/335305.335408MaRDI QIDQ3192047zbMATH OpenOpenAlexFDO

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

Recommendations

• Better Algorithms for Unfair Metrical Task Systems and Applications
• Unfair problems and randomized algorithms for metrical task systems
• scientific article; zbMATH DE number 1559591
• Metrical task systems on trees via mirror descent and unfair gluing
• Randomized algorithms for metrical task systems

Cited in

(7)

• Unfair problems and randomized algorithms for metrical task systems
• A general decomposition theorem for the k-server problem
• Nested convex bodies are chaseable
• Better Algorithms for Unfair Metrical Task Systems and Applications
• A randomized on–line algorithm for the k–server problem on a line
• A tight bound on approximating arbitrary metrics by tree metrics
• Parametrized Metrical Task Systems

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

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