Better Bounds for Online Line Chasing

DOI10.4230/LIPIcs.MFCS.2019.8OpenAlexW2970059121MaRDI QIDQ5092366

Łukasz Jeż, Marcin Bienkowski, Christian Coester, Elias Koutsoupias, Jaroslaw Byrka, Marek Chrobak

Publication date: 21 July 2022

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

zbMATH Keywords

competitive analysisconvex body chasingline chasing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On convex body chasing
• Chasing Convex Bodies and Functions
• Competitive algorithms for server problems
• Competitive Algorithms for Layered Graph Traversal
• An optimal on-line algorithm for metrical task system
• On the k -server conjecture
• On Traversing Layered Graphs On-Line
• Traversing Layered Graphs Using the Work Function Algorithm
• Competitively chasing convex bodies
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem

This page was built for publication: Better Bounds for Online Line Chasing