Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Pure Tail Constraints for Online Problems
Mateusz Basiak, Marcin Bienkowski, Yongho Shin +1
Controlling tail risk is an important objective in online optimization, and recently it has been studied in the context of competitive analysis. Continuing this line of research, w…
cs.DS2026
Online Bisection with Ring Demands
Mateusz Basiak, Marcin Bienkowski, Guy Even +1
The online bisection problem requires maintaining a dynamic partition of nodes into two equal-sized clusters. Requests arrive sequentially as node pairs. If the nodes lie in di…