Chasing convex bodies optimally

DOI10.1007/978-3-031-26300-2_12MaRDI QIDQ6608553

Mark Sellke

Publication date: 20 September 2024

zbMATH Keywords

competitive rationested convex bodieschasing convex bodies problemfunctional Steiner point

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Online algorithms; streaming algorithms (68W27) Computer assisted proofs of proofs-by-exhaustion type (68V05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On convex body chasing
• On-line learning and the metrical task system problem
• Lipschitz selections of set-valued mappings and Helly's theorem
• Sharp finiteness principles for Lipschitz selections
• Ramsey-type theorems for metric spaces with applications to online problems
• On metric Ramsey-type phenomena
• Chasing Convex Bodies and Functions
• A Polylogarithmic-Competitive Algorithm for the k -Server Problem
• Competitive algorithms for server problems
• The online set cover problem
• An optimal on-line algorithm for metrical task system
• On the k -server conjecture
• Better Algorithms for Unfair Metrical Task Systems and Applications
• Von dem Krümmungs-Schwerpuncte ebener Curven.
• Chasing Convex Bodies with Linear Competitive Ratio
• Chasing Nested Convex Bodies Nearly Optimally
• Competitively chasing convex bodies
• Metrical task systems on trees via mirror descent and unfair gluing
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• Bounds for Certain Multiprocessing Anomalies
• Convex Analysis

This page was built for publication: Chasing convex bodies optimally