activity
20092023
most citedSubmodular Optimization with Submodular Cover and Submodular Knapsack Constraints

166 citations · 1.4k across the 47 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.DM2018★ 13 cited

Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions

Wenruo Bai, Jeffrey A. Bilmes

We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both o…