scientific article; zbMATH DE number 1559591
From MaRDI portal
Publication:4527040
Recommendations
Cited in
(32)- Randomized algorithms for metrical task systems
- On algorithm design for metrical task systems
- A randomized algorithm for two servers on the line.
- A general decomposition theorem for the k-server problem
- New results for online page replication
- The weighted 2-server problem
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Metrical service systems with multiple servers
- Uniform metrical task systems with a limited number of states
- Ramsey-type theorems for metric spaces with applications to online problems
- A combinatorial metrical task system problem under the uniform metric
- Better algorithms for unfair metrical task systems and applications
- Metrical task systems and the k-server problem on HSTs
- An optimal on-line algorithm for metrical task system
- Better Algorithms for Unfair Metrical Task Systems and Applications
- The \(k\)-server problem
- Metrical service systems with multiple servers
- A regularization approach to metrical task systems
- Metrical task systems on trees via mirror descent and unfair gluing
- Randomized algorithms for metrical task systems
- Pure entropic regularization for metrical task systems
- Metrical task systems on trees via mirror descent and unfair gluing
- STACS 2004
- A randomized on–line algorithm for the k–server problem on a line
- A tight bound on approximating arbitrary metrics by tree metrics
- Local embeddings of metric spaces
- Parametrized Metrical Task Systems
- Spanners in sparse graphs
- Adaptive-adversary-robust algorithms via small copy tree embeddings
- Online metric allocation and time-varying regularization
- Competitive ratio vs regret minimization: achieving the best of both worlds
- On multi-threaded metrical task systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527040)
