Fetching the paper…
Reading the bibliography…
Submodularity is a fundamental phenomenon in combinatorial optimization.
Matroids, submodular functions, and certain polyhedra
Jack Edmonds · 1970
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
Martin Grötschel, Lázló Lovász, and Alexander Schrijver · 1981
Earlier work this paper cites.
Submodular functions and convexity
Lázló Lovász · 1982
Earlier work this paper cites.
Unbalanced graph cuts
Ara Hayrapetyan, David Kempe, Martin Pál, and Zoya Svitkina · 2005
Cited alongside, same era.
Maximizing a submodular set function subject to a matroid constraint (extended abstract)
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2007
Cited alongside, same era.
Maximizing non-monotone submodular functions
Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák · 2007
Cited alongside, same era.
Submodularity in combinatorial optimization
Jan Vondrák · 2007
Later among the works it cites.
Optimal approximation for the submodular welfare problem in the value oracle model
Jan Vondrák · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…