Parametrized Metrical Task Systems

DOI10.4230/lipics.approx/random.2020.54arXiv1904.03874OpenAlexW3082216760MaRDI QIDQ6084418

Sébastien Bubeck, Yuval Rabani

Publication date: 31 October 2023

Full work available at URL: https://arxiv.org/abs/1904.03874

zbMATH Keywords

competitive analysismetrical task systemsonline computing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Online Metric Algorithms with Untrusted Predictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Randomized algorithms for metrical task systems
• On convex body chasing
• Unfair problems and randomized algorithms for metrical task systems
• On algorithm design for metrical task systems
• Metrical service systems with multiple servers
• On metric Ramsey-type phenomena
• A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
• Better algorithms for unfair metrical task systems and applications
• Competitive algorithms for server problems
• Optimal Power-Down Strategies
• Metrical Task Systems and the k-Server Problem on HSTs
• Competitive paging algorithms
• An optimal on-line algorithm for metrical task system
• Traversing Layered Graphs Using the Work Function Algorithm
• A Regularization Approach to Metrical Task Systems
• Metrical task systems on trees via mirror descent and unfair gluing
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Parametrized Metrical Task Systems