48 citations · 282 across the 41 of their papers we have counts for
4 papers · 2 filters
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…
Maximizing Symmetric Submodular Functions
Moran Feldman
Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Maximization of s…
Constrained Monotone Function Maximization and the Supermodular Degree
Moran Feldman, Rani Izsak
The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possib…
A Simple -Competitive Algorithm for the Matroid Secretary Problem
Moran Feldman, Ola Svensson, Rico Zenklusen
Only recently progress has been made in obtaining -competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012)…