6 citations · 6 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015
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…
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…