Tag online algorithms

Unlocking the Secrets of Competitively Chasing Convex Sets in Metric Spaces

The landscape of online algorithms has been significantly reshaped by a recent breakthrough in the understanding of the \(\mathcal{F}\)-chasing problem, specifically concerning convex bodies. Researchers Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke have proven a conjecture that… Continue Reading →

The $k$-Server Problem on Trees: An Insightful Look at Online Algorithms and Bregman Projections

The field of online algorithms has been rapidly advancing, particularly with the recent contributions to the $k$-server problem presented in “Online Algorithms via Projections”. This article explores the latest research that leverages Bregman projections to enhance efficiency in $k$-server problems… Continue Reading →

© 2024 Christophe Garon — Powered by WordPress

Theme by Anders NorenUp ↑