Fetching the paper…
Reading the bibliography…
We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or $p\geq 1$ matroid independence constraints.
A method for the construction of minimum-redundancy codes
David A Huffman · 1952
Earlier work this paper cites.
On the shortest spanning subtree of a graph and the traveling salesman problem
Joseph B Kruskal · 1956
Earlier work this paper cites.
Shortest connection networks and some generalizations
Robert Clay Prim · 1957
Earlier work this paper cites.
Submodular functions, Matroids and Certain Polyhedra
J. Edmonds · 1970
Earlier work this paper cites.
Matroids and the greedy algorithm
Jack Edmonds · 1971
Earlier work this paper cites.
A greedy algorithm for solving a certain class of linear programmes
FDJ Dunstan and DJA Welsh · 1973
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.
The greedy algorithm for partially ordered sets
Ulrich Faigle · 1979
Earlier work this paper cites.
An analysis of the greedy algorithm for the submodular set covering problem
Laurence A. Wolsey · 1982
Earlier work this paper cites.
Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
M. Conforti and G. Cornuejols · 1984
Earlier work this paper cites.
On submodular function minimization
W.H. Cunningham · 1985
Earlier work this paper cites.
Valuated matroids: A new look at the greedy algorithm
Andreas WM Dress and Walter Wenzel · 1990
Earlier work this paper cites.
Gpsr: Greedy perimeter stateless routing for wireless networks
Brad Karp and Hsiang-Tsung Kung · 2000
Earlier work this paper cites.
Models of translational equivalence among words
I Dan Melamed · 2000
Earlier work this paper cites.
A greedy algorithm for aligning dna sequences
Zheng Zhang, Scott Schwartz, Lukas Wagner, and Webb Miller · 2000
Earlier work this paper cites.
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
Victor P Il’ev · 2001
Earlier work this paper cites.
On greedy algorithms, partially ordered sets, and submodular functions
Brenda L Dietrich and Alan J Hoffman · 2003
Earlier work this paper cites.
When the greedy algorithm fails
Jørgen Bang-Jensen, Gregory Gutin, and Anders Yeo · 2004
Cited alongside, same era.
Submodular functions and optimization , volume 58
S. Fujishige · 2005
Cited alongside, same era.
A submodular-supermodular procedure with applications to discriminative structure learning
Mukund Narasimhan and Jeff Bilmes · 2005
Cited alongside, same era.
On the complexity of approximating k-set packing
Elad Hazan, Shmuel Safra, and Oded Schwartz · 2006
Cited alongside, same era.
Near-optimal sensor placements: Maximizing information while minimizing communication cost
Andreas Krause, Carlos Guestrin, Anupam Gupta, and Jon Kleinberg · 2006
Cited alongside, same era.
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz and Thomas Stützle · 2007
Learning mixtures of submodular shells with application to document summarization
H. Lin and J. Bilmes · 2012
Later among the works it cites.
Welfare maximization and the supermodular degree
Uriel Feige and Rani Izsak · 2013
Later among the works it cites.
Tight bounds for submodular and supermodular optimization with bounded curvature
Maxim Sviridenko, Jan Vondrák, and Justin Ward · 2013
Later among the works it cites.
Proportionally (formerly weakly) submodular functions
Allan Borodin, Dai Le, and Yuli Ye · 2014
Later among the works it cites.
Constrained monotone function maximization and the supermodular degree
Moran Feldman and Rani Izsak · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Advances in greedy algorithms , volume 14
Witold Bednorz, editor · 2008
Cited alongside, same era.
Quasi-concave functions and greedy algorithms
Yulia Kempner, Vadim E Levit, and Ilya Muchnik · 2008
Cited alongside, same era.
Introduction to algorithms
Thomas H Cormen · 2009
Cited alongside, same era.
Approximating submodular functions everywhere
Michel X Goemans, Nicholas JA Harvey, Satoru Iwata, and Vahab Mirrokni · 2009
Cited alongside, same era.
P 3 & beyond: Move making algorithms for solving higher order functions
Pushmeet Kohli, M Pawan Kumar, and Philip HS Torr · 2009
Cited alongside, same era.
Submodular maximization over multiple matroids via generalized exchange properties
Jon Lee, Maxim Sviridenko, and Jan Vondrák · 2010
Cited alongside, same era.
Optimal approximation for submodular and supermodular optimization with bounded curvature
Maxim Sviridenko, Jan Vondrák, and Justin Ward · 2015
Later among the works it cites.
Submodularity in data subset selection and active learning
Kai Wei, Rishabh Iyer, and Jeff Bilmes · 2015
Later among the works it cites.
Bipartite matching generalizations for peptide identification in tandem mass spectrometry
Wenruo Bai, Jeffrey Bilmes, and William S. Noble · 2016
Later among the works it cites.
Maximization of approximately submodular functions
Thibaut Horel and Yaron Singer · 2016
Later among the works it cites.
Maximizing a monotone supermodular function subject to a cardinality constraint
usul https://cstheory.stackexchange.com/users/8243/usul · 2016
Later among the works it cites.
Approximation for maximizing monotone non-decreasing set functions with a greedy method
Zengfu Wang, Bill Moran, Xuezhi Wang, and Quan Pan · 2016
Later among the works it cites.
Guarantees for greedy maximization of non-submodular functions with applications
Andrew An Bian, Joachim M Buhmann, Andreas Krause, and Sebastian Tschiatschek · 2017
Later among the works it cites.
Jeffrey Bilmes and Wenruo Bai · 2017
Later among the works it cites.
Improved bounds for the greedy strategy in optimization problems with curvatures
Yajing Liu, Edwin KP Chong, and Ali Pezeshki · 2017
Later among the works it cites.
Interleaved algorithms for constrained submodular function maximization
Kanthi K Sarpatwar, Baruch Schieber, and Hadas Shachnai · 2017
Later among the works it cites.
J David Smith and My T Thai · 2017
Later among the works it cites.