1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Online Algorithms with Randomly Infused Advice
Yuval Emek, Yuval Gil, Maciej Pacut +1
We introduce a novel method for the rigorous quantitative evaluation of online algorithms that relaxes the "radical worst-case" perspective of classic competitive analysis. In cont…
cs.DS2024
A Subquadratic Bound for Online Bisection
Marcin Bienkowski, Stefan Schmid
The online bisection problem is a natural dynamic variant of the classic optimization problem, where one has to dynamically maintain a partition of elements into two clusters o…