A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

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. S. Naor · 1999

Earlier work this paper cites.

Maximizing the spread of influence through a social network

D. Kempe, J. M. Kleinberg, and É. Tardos · 2003

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.

Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies

A. Krause, A. P. Singh, and C. Guestrin · 2008

Cited alongside, same era.

Budgeted nonparametric learning from data streams

R. Gomes and A. Krause · 2010

Cited alongside, same era.

Multi-document summarization via budgeted maximization of submodular functions

H. Lin and J. A. Bilmes · 2010

Cited alongside, same era.

Submodularity beyond submodular energies: Coupling edges in graph cuts

S. Jegelka and J. A. Bilmes · 2011

Cited alongside, same era.

Revenue submodularity

S. Dughmi, T. Roughgarden, and M. Sundararajan · 2012

Later among the works it cites.

Approximations for monotone and nonmonotone submodular maximization with knapsack constraints

A. Kulik, H. Shachnai, and T. Tamir · 2013

Later among the works it cites.

Fast algorithms for maximizing submodular functions

A. Badanidiyuru and J. Vondrák · 2014

Later among the works it cites.

Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint

Original

Y. Yoshida · 2016

Later among the works it cites.