23 citations · 48 across the 24 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
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
Niv Buchbinder, Moran Feldman, Roy Schwartz
Fast algorithms for submodular maximization problems have a vast potential use in applicative settings, such as machine learning, social networks, and economics. Though fast algori…