32 citations · 43 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Online Packing and Covering Framework with Convex Objectives
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…
cs.DS2014★ 10 cited
Near-Optimum Online Ad Allocation for Targeted Advertising
Joseph, Naor, David Wajc
Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established these problems admit no randomized online algorithm better than $(…