6 citations · 6 across the 5 of their papers we have counts for
5 papers
Online Algorithms via Minimax and Posterior Matching
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Competitive analysis is central to the study of online algorithms, but upper bounds are often highly problem-specific. We develop a more unifying methodology via the minimax viewpo…
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…
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…
Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Many classical problems in theoretical computer science involve norm, even if implicitly; for example, both XOS functions and downward-closed sets are equivalent to some norms. The…
Geometry of Online Packing Linear Programs
Marco Molinaro, R. Ravi
We consider packing LP's with rows where all constraint coefficients are normalized to be in the unit interval. The n columns arrive in random order and the goal is to set the…