137 citations · 650 across the 48 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018★ 2 cited
Stochastic Load Balancing and Moment Problems via the -Function Method
Marco Molinaro
This paper considers stochastic optimization problems whose objective functions involve powers of random variables. For example, consider the classic Stochastic lp Load Balancing P…
cs.DS2018★ 1 cited
-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, Marco Molinaro +2
We consider the -server problem on trees and HSTs. We give an algorithm based on Bregman projections. This algorithm has a competitive ratios that match some of the recent resul…
cs.DS2018
Maximizing Profit with Convex Costs in the Random-order Model
Anupam Gupta, Ruta Mehta, Marco Molinaro
Suppose a set of requests arrives online: each request gives some value if accepted, but requires using some amount of each of resources. Our cost is a convex function of…