Practical Budgeted Submodular Maximization

An analysis of approximations for maximizing submodular set functions-i

G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher · 1978

Earlier work this paper cites.

Best algorithms for approximating the maximum of a submodular set function

George L. Nemhauser and Laurence A. Wolsey · 1978

Earlier work this paper cites.

Maximising real-valued submodular functions: primal and dual heuristics for location problems

L. A. Wolsey · 1982

Earlier work this paper cites.

The budgeted maximum coverage problem

S. Khuller, A. Moss, and J. Naor · 1999

Earlier work this paper cites.

A note on maximizing a submodular set function subject to a knapsack constraint

M. Sviridenko · 2004

Earlier work this paper cites.

“bring your own greedy”+max: Near-optimal 1/2-approximations for submodular knapsack

Original

G. Yaroslavtsev, S. Zhou, and D. Avdiukhin · 2007

Earlier work this paper cites.

The generalized maximum coverage problem

R. Cohen and L. Katzir · 2008

Earlier work this paper cites.

Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint

Original

J. Tang, X. Tang, A. Lim, K. Han, C. Li, and J. Yuan · 2008

Earlier work this paper cites.

Submodular maximization over multiple matroids via generalized exchange properties

Jon Lee, Maxim Sviridenko, and Jan Vondrák · 2010

Cited alongside, same era.

Maximizing a monotone submodular function subject to a matroid constraint

Gruia Călinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011

Cited alongside, same era.

Improved approximations for k-exchange systems - (extended abstract)

Moran Feldman, Joseph Naor, Roy Schwartz, and Justin Ward · 2011

Cited alongside, same era.

A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems

Justin Ward · 2012

Cited alongside, same era.

Approximations for monotone and nonmonotone submodular maximization with knapsack constraints

Ariel Kulik, Hadas Shachnai, and Tami Tamir · 2013

Cited alongside, same era.

Fast algorithms for maximizing submodular functions

Streaming weak submodularity: Interpreting neural networks on the fly

Ethan R. Elenberg, Alexandros G. Dimakis, Moran Feldman, and Amin Karbasi · 2017

Later among the works it cites.

A submodular approach to create individualized parcellations of the human brain

Mehraveh Salehi, Amin Karbasi, Dustin Scheinost, and R. Todd Constable · 2017

Later among the works it cites.

Scalable deletion-robust submodular maximization: Data summarization with privacy and fairness constraints

Ehsan Kazemi, Morteza Zadimoghaddam, and Amin Karbasi · 2018

Later among the works it cites.

Choosing non-redundant representative subsets of protein sequence data sets using submodular optimization

Maxwell W. Libbrecht, Jeffrey A. Bilmes, and William Stafford Noble · 2018

Later among the works it cites.

Data summarization at scale: A two-stage submodular approach

Marko Mitrovic, Ehsan Kazemi andMorteza Zadimoghaddam, and Amin Karbasi · 2018

Later among the works it cites.