Metrical task systems on trees via mirror descent and unfair gluing
From MaRDI portal
Publication:4994985
Recommendations
Cites work
- \(k\)-server via multiscale entropic regularization
- A decomposition theorem for task systems and bounds for randomized server problems
- A first course in Sobolev spaces
- A polylogarithmic-competitive algorithm for the k-server problem
- A primal-dual randomized algorithm for weighted paging
- A tight bound on approximating arbitrary metrics by tree metrics
- An optimal on-line algorithm for metrical task system
- Better Algorithms for Unfair Metrical Task Systems and Applications
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- Metrical task systems and the k-server problem on HSTs
- Ramsey-type theorems for metric spaces with applications to online problems
- Unfair problems and randomized algorithms for metrical task systems
Cited in
(5)
This page was built for publication: Metrical task systems on trees via mirror descent and unfair gluing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994985)