23 citations · 48 across the 24 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
Deterministic Algorithms for Submodular Maximization Problems
Niv Buchbinder, Moran Feldman
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function max…
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…