Fetching the paper…
Reading the bibliography…
Submodular functions are well-studied in combinatorial optimization, game theory and economics.
Comments on bases in dependence structures
R. A. Brualdi · 1969
Earlier work this paper cites.
The efficacy of the ‘greedy’ algorithm
T. Jenkyns · 1976
Earlier work this paper cites.
An analysis of the approximations for maximizing submodular set functions
G. Nemhauser, L. Wolsey, and M. Fisher · 1978
Earlier work this paper cites.
A threshold of ln n for approximating set cover
U. Feige · 1998
Earlier work this paper cites.
Segmentation problems
J. Kleinberg, C. Papadimitriou, and P. Raghavan · 1998
Earlier work this paper cites.
Analysis of a local search heuristic for facility location problems
M. R. Korupolu, C. Plaxton, and R. Rajaraman · 2000
Earlier work this paper cites.
The dense k -subgraph problem
U. Feige, G. Kortsarz, and D. Peleg · 2001
Earlier work this paper cites.
Maximizing the spread of influence through a social network
D. Kempe, J. Kleinberg, and E. Tardos · 2003
Earlier work this paper cites.
Combinatorial auctions with k- wise dependent valuations
V. Conitzer, T. Sandholm, and P. Santi · 2005
Earlier work this paper cites.
Greedy in approximation algorithms
J. Mestre · 2006
Cited alongside, same era.
Maximizing non-monotone submodular functions
U. Feige, V. S. Mirrokni, and J. Vondrak · 2007
Cited alongside, same era.
Weakly submoudlar rank functions, supermatoids, and the flat lattice of a distributive supermatroid
M. Wild · 2008
Cited alongside, same era.
Finding dense subgraphs with size bounds
R. Andersen and K. Chellapilla · 2009
Cited alongside, same era.
An improved analysis for a greedy remote-clique algorithm using factor-revealing lps
B. E. Birnbaum and K. J. Goldman · 2009
Cited alongside, same era.
An axiomatic approach for result diversification
S. Gollapudi and A. Sharma · 2009
Cited alongside, same era.
A class of submodular functions for document summarization
H. Lin and J. Bilmes · 2011
Later among the works it cites.
Max-sum diversification, monotone submodular functions and dynamic updates
A. Borodin, H. C. Lee, and Y. Ye · 2012
Later among the works it cites.
A tight linear time (1/2)-approximation for unconstrained submodular maximization
N. Buchbinder, M. Feldman, J. S. Naor, and R. Schwartz · 2012
Later among the works it cites.
Welfare maximization and the supermodular degree
U. Feige and R. Izsak · 2013
Later among the works it cites.
General context amenable to greedy and greedy-like algorithms
Y. Ye · 2013
Later among the works it cites.
Max-sum diversification, monotone submodular functions and dynamic updates (revised version)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On finding dense subgraphs
S. Khuller and B. Saha · 2009
Cited alongside, same era.
Approximation algorithms for diversified search ranking
N. Bansal, K. Jain, A. Kazeykina, and J. Naor · 2010
Cited alongside, same era.
Inapproximability of densest κ \kappa -subgraph from average case hardness
N. Alon, S. Arora, R. Manoikaran, D. Moshkovitz, and O. Weinstein · 2011
Cited alongside, same era.
A. Borodin, A. Jain, H. C. Lee, and Y. Ye · 2014
Closest in time.
Submodular maximization with cardinality constraints
N. Buchbinder, M. Feldman, J. Naor, and R. Schwartz · 2014
Closest in time.
A unifying hierarchy of valuations with complements and substitutes
U. Feige, M. Feldman, N. Immorlica, R. Izsak, B. Lucier, and V. Syrgkanis · 2014
Closest in time.
Constrained monotone function maximization and the supermodular degree
M. Feldman and R. Izsak · 2014
Closest in time.