1 paper
Niv Buchbinder, Shahar Chen, Anupam Gupta +3
We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\min\,\{f(x) \mid Ax\ge \mathb…