2 papers
cs.DS2025
Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives…
cs.DS2024
The Power of Migrations in Dynamic Bin Packing
Konstantina Mellou, Marco Molinaro, Rudy Zhou
In the Dynamic Bin Packing problem, items arrive and depart the system in an online manner, and the goal is to maintain a good packing throughout. We consider the objective of…