Better Algorithms for Unfair Metrical Task Systems and Applications

DOI10.1137/S0097539700376159MaRDI QIDQ4429694zbMATH OpenOpenAlexWikidataFDO

Authors Manor Mendel, Amos Fiat

Publication date 28 September 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539700376159

zbMATH Keywords

online algorithmsrandomized algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Recommendations

• Better algorithms for unfair metrical task systems and applications
• Unfair problems and randomized algorithms for metrical task systems
• On algorithm design for metrical task systems
• scientific article; zbMATH DE number 910899
• Randomized algorithms for metrical task systems
• Randomized algorithms for metrical task systems
• Metrical task systems on trees via mirror descent and unfair gluing
• Metrical task systems on trees via mirror descent and unfair gluing
• scientific article; zbMATH DE number 1559591

Cited in

(10)

• Ramsey-type theorems for metric spaces with applications to online problems
• Adaptive-adversary-robust algorithms via small copy tree embeddings
• Online metric allocation and time-varying regularization
• Online computation with advice
• Metrical task systems on trees via mirror descent and unfair gluing
• Better algorithms for unfair metrical task systems and applications
• Chasing convex bodies optimally
• The \(k\)-server problem
• A combinatorial metrical task system problem under the uniform metric
• Competitive ratio vs regret minimization: achieving the best of both worlds

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