16 citations · 16 across the 5 of their papers we have counts for
5 papers
$O(\mbox{depth})$-Competitive Algorithm for Online Multi-level Aggregation
Niv Buchbinder, Moran Feldman, Joseph Naor +1
We consider a multi-level aggregation problem in a weighted rooted tree, studied recently by Bienkowski et al. (2015). In this problem requests arrive over time at the nodes of the…
Constrained Submodular Maximization via a Non-symmetric Technique
Niv Buchbinder, Moran Feldman
The study of combinatorial optimization problems with a submodular objective has attracted much attention in recent years. Such problems are important in both theory and practice b…
Online Submodular Maximization with Preemption
Niv Buchbinder, Moran Feldman, Roy Schwartz
Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study…
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…
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
Niv Buchbinder, Joseph, Naor +2
Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is…