Chasing convex bodies optimally
From MaRDI portal
Cites work
- A Nearly-Linear Bound for Chasing Nested Convex Bodies
- A polylogarithmic-competitive algorithm for the k-server problem
- An optimal on-line algorithm for metrical task system
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Bounds for Certain Multiprocessing Anomalies
- Chasing convex bodies and functions
- Chasing Convex Bodies with Linear Competitive Ratio
- Chasing Nested Convex Bodies Nearly Optimally
- Competitive algorithms for server problems
- Competitively chasing convex bodies
- Convex Analysis
- scientific article; zbMATH DE number 3964717 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 2206417 (Why is no real title available?)
- Lipschitz selections of set-valued mappings and Helly's theorem
- Metrical task systems on trees via mirror descent and unfair gluing
- Nested convex bodies are chaseable
- On convex body chasing
- On the k -server conjecture
- On-line learning and the metrical task system problem
- Ramsey-type theorems for metric spaces with applications to online problems
- Sharp finiteness principles for Lipschitz selections
- The online set cover problem
- Von dem Krümmungs-Schwerpuncte ebener Curven.
This page was built for publication: Chasing convex bodies optimally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608553)
