Fetching the paper…
Reading the bibliography…
The study of combinatorial optimization problems with a submodular objective has attracted much attention in recent years.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
The efficacy of the greedy algorithm
T. Jenkyns · 1976
Earlier work this paper cites.
Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms
G. Cornuejols, M. L. Fisher, and G. L. Nemhauser · 1977
Earlier work this paper cites.
On the uncapacitated location problem
G. Cornuejols, M. L. Fisher, and G. L. Nemhauser · 1977
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions – ii
M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey · 1978
Earlier work this paper cites.
K-greedy algorithms for independence systems
D. Hausmann and B. Korte · 1978
Earlier work this paper cites.
An analysis of the greedy heuristic for independence systems
B. Korte and D. Hausmann · 1978
Earlier work this paper cites.
Best algorithms for approximating the maximum of a submodular set function
G. L. Nemhauser and L. A. Wolsey · 1978
Earlier work this paper cites.
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.
Worst case analysis of greedy type algorithms for independence systems
D. Hausmann, B. Korte, and T. Jenkyns · 1980
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
L. Lovász M. Grötschel and A. Schrijver · 1981
Earlier work this paper cites.
Submodular functions and convexity
László Lovász · 1983
Earlier work this paper cites.
Submodular set functions, matroids and the greedy algorithm. tight worstcase bounds and some generalizations of the radoedmonds theorem
M. Conforti and G. Cornuèjols · 1984
Earlier work this paper cites.
Aproximating the value of two prover proof systems, with applications to max 2sat and max dicut
Uriel Feige and Michel X. Goemans · 1995
Earlier work this paper cites.
Improved approximation algorithms for max k-cut and max bisection
Alan M. Frieze and Mark Jerrum · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
A threshold of ln n \ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
An 0.828 approximation algorithm for the uncapacitated facility location problem
A. A. Ageev and M. I. Sviridenko · 1999
Earlier work this paper cites.
The budgeted maximum coverage problem
S. Khuller, A. Moss, and J. Naor · 1999
Earlier work this paper cites.
The Probabilistic Method
Noga Alon and Joel H. Spencer · 2000
Cited alongside, same era.
Gadgets, approximation, and linear programming
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson · 2000
Cited alongside, same era.
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
Y. Y. Boykov and M. P. Jolly · 2001
Cited alongside, same era.
Combinatorial approximation algorithms for the maximum directed cut problem
Eran Halperin and Uri Zwick · 2001
Cited alongside, same era.
Some optimal inapproximability results
Johan Hȧstad · 2001
Cited alongside, same era.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Cited alongside, same era.
Multi-document summarization via budgeted maximization of submodular functions
Hui Lin and Jeff Bilmes · 2010
Later among the works it cites.
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Călinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011
Later among the works it cites.
Approximation algorithms for submodular multiway partition
Chandra Chekuri and Alina Ene · 2011
Later among the works it cites.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen · 2011
Later among the works it cites.
Maximizing non-monotone submodular functions
Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák · 2011
Later among the works it cites.
A unified continuous greedy algorithm for submodular maximization
Moran Feldman, Joseph Naor, and Roy Schwartz · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A note on maximizing a submodular set function subject to knapsack constraint
Maxim Sviridenko · 2004
Cited alongside, same era.
A polynomial time approximation scheme for the multiple knapsack problem
Chandra Chekuri and Sanjeev Khanna · 2005
Cited alongside, same era.
Near-optimal nonmyopic value of information in graphical models
Andreas Krause and Carlos Guestrin · 2005
Cited alongside, same era.
An efficient approximation for the generalized assignment problem
Reuven Cohen, Liran Katzir, and Danny Raz · 2006
Cited alongside, same era.
Approximation algorithms for allocation problems: Improving the factor of 1 − 1 / e 1-1/e
Uriel Feige and Jan Vondrák · 2006
Cited alongside, same era.
Tight approximation algorithms for maximum general assignment problems
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko · 2006
Cited alongside, same era.
Later among the works it cites.
Improved approximations for k-exchange systems
Moran Feldman, Joseph (Seffi) Naor, Roy Schwartz, and Justin Ward · 2011
Later among the works it cites.
Submodular maximization by simulated annealing
Shayan Oveis Gharan and Jan Vondrák · 2011
Later among the works it cites.
Submodularity beyond submodular energies: Coupling edges in graph cuts
S. Jegelka and J. Bilmes · 2011
Later among the works it cites.
A class of submodular functions for document summarization
Hui Lin and Jeff Bilmes · 2011
Later among the works it cites.
A tight linear time (1/2)-approximation for unconstrained submodular maximization
Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, and Roy Schwartz · 2012
Later among the works it cites.
Better balance by being biased: A 0.8776-approximation for max bisection
Per Austrin, Siavosh Benabbas, and Konstantinos Georgiou · 2013
Later among the works it cites.
Learning with submodular functions: A convex optimization perspective
Francis Bach · 2013
Later among the works it cites.
Maximization Problems with Submodular Objective Functions
Moran Feldman · 2013
Later among the works it cites.
Approximations for monotone and nonmonotone submodular maximization with knapsack constraints
Ariel Kulik, Hadas Shachnai, and Tami Tamir · 2013
Later among the works it cites.
Symmetry and approximability of submodular maximization problems
Jan Vondrák · 2013
Later among the works it cites.
Submodular maximization with cardinality constraints
Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, and Roy Schwartz · 2014
Later among the works it cites.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen · 2014
Later among the works it cites.
Constrained submodular maximization: Beyond 1/e
Alina Ene and Huy L. Nguyen · 2016
Closest in time.