Fetching the paper…
Reading the bibliography…
Submodular functions have found a wealth of new applications in data science and machine learning models in recent years.
Optimal software test planning through automated network analysis
KW Krause, MA Goodwin, and RW Smith · 1973
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions-II
Marshall L Fisher, George L Nemhauser, and Laurence A Wolsey · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions - i
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
Best algorithms for approximating the maximum of a submodular set function
George L Nemhauser and Leonard A Wolsey · 1978
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 worst-case bounds and some generalizations of the rado-edmonds theorem
Michele Conforti and Gérard Cornuéjols · 1984
Earlier work this paper cites.
Directed submodularity, ditroids and directed submodular flows
Liqun Qi · 1988
Earlier work this paper cites.
Delta-matroids, jump systems, and bisubmodular polyhedra
André Bouchet and William H Cunningham · 1995
Earlier work this paper cites.
Minimizing submodular functions over families of sets
Michel X. Goemans and VS Ramakrishnan · 1995
Earlier work this paper cites.
A characterization of bisubmodular functions
Kazutoshi Ando, Satoru Fujishige, and Takeshi Naitoh · 1996
Earlier work this paper cites.
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Alexander Schrijver · 2000
Earlier work this paper cites.
Interactive graph cuts for optimal boundary & region segmentation of objects in nd images
Yuri Y Boykov and M-P Jolly · 2001
Earlier work this paper cites.
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Satoru Iwata, Lisa Fleischer, and Satoru Fujishige · 2001
Earlier work this paper cites.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Earlier work this paper cites.
Combinatorial optimization: polyhedra and efficiency
Alexander Schrijver · 2003
Earlier work this paper cites.
Bisubmodular function minimization
Satoru Fujishige and Satoru Iwata · 2005
Earlier work this paper cites.
Network design for information networks
Ara Hayrapetyan, Chaitanya Swamy, and Éva Tardos · 2005
Earlier work this paper cites.
Inapproximability results for combinatorial auctions with submodular utility functions
Subhash Khot, Richard J Lipton, Evangelos Markakis, and Aranyak Mehta · 2005
Earlier work this paper cites.
Tight approximation algorithms for maximum general assignment problems
Lisa Fleischer, Michel X Goemans, Vahab S Mirrokni, and Maxim Sviridenko · 2006
Earlier work this paper cites.
On the complexity of approximating k-set packing
Elad Hazan, Shmuel Safra, and Oded Schwartz · 2006
Earlier work this paper cites.
Combinatorial auctions with decreasing marginal utilities
Benny Lehmann, Daniel Lehmann, and Noam Nisan · 2006
Earlier work this paper cites.
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2007
Earlier work this paper cites.
Revisiting the greedy approach to submodular set function maximization
Pranava R Goundan and Andreas S Schulz · 2007
Earlier work this paper cites.
Near-optimal observation selection using submodular functions
Andreas Krause and Carlos Guestrin · 2007
Cited alongside, same era.
Efficient sensor placement optimization for securing large water distribution networks
Andreas Krause, Jure Leskovec, Carlos Guestrin, Jeanne VanBriesen, and Christos Faloutsos · 2008
Cited alongside, same era.
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
Vahab Mirrokni, Michael Schapira, and Jan Vondrák · 2008
Cited alongside, same era.
Optimal approximation for the submodular welfare problem in the value oracle model
Jan Vondrák · 2008
Cited alongside, same era.
Turning down the noise in the blogosphere
Khalid El-Arini, Gaurav Veda, Dafna Shahaf, and Carlos Guestrin · 2009
Cited alongside, same era.
Approximability of combinatorial problems with multi-agent submodular cost functions
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Jan Vondrák, Chandra Chekuri, and Rico Zenklusen · 2011
Later among the works it cites.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 2012
Later among the works it cites.
Towards minimizing k-submodular functions
Anna Huber and Vladimir Kolmogorov · 2012
Later among the works it cites.
On bisubmodular maximization
Ajit Singh, Andrew Guillory, and Jeff Bilmes · 2012
Later among the works it cites.
The power of linear programming for valued csps
Johan Thapper and Stanislav Zivny · 2012
Later among the works it cites.
Curvature and optimal algorithms for learning and minimizing submodular functions
Rishabh K Iyer, Stefanie Jegelka, and Jeff A Bilmes · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gagan Goel, Chinmay Karande, Pushkar Tripathi, and Lei Wang · 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.
Submodular function minimization under covering constraints
Satoru Iwata and Kiyohito Nagano · 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.
Maximizing submodular set functions subject to multiple linear constraints
Ariel Kulik, Hadas Shachnai, and Tami Tamir · 2009
Cited alongside, same era.
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab S Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko · 2009
Cited alongside, same era.
An online algorithm for maximizing submodular functions
Matthew Streeter and Daniel Golovin · 2009
Cited alongside, same era.
Symmetry and approximability of submodular maximization problems
Jan Vondrák · 2013
Later among the works it cites.
Hardness of submodular cost allocation: Lattice matching and a simplex coloring conjecture
Alina Ene and Jan Vondrák · 2014
Later among the works it cites.
Skew bisubmodularity and valued csps
Anna Huber, Andrei Krokhin, and Robert Powell · 2014
Later among the works it cites.
Monotone closure of relaxed constraints in submodular optimization: Connections between minimization and maximization: Extended version
Rishabh Iyer, Stefanie Jegelka, and Jeff Bilmes · 2014
Later among the works it cites.
Maximizing bisubmodular and k-submodular functions
Justin Ward and Stanislav Živnỳ · 2014
Later among the works it cites.
A tight linear time (1/2)-approximation for unconstrained submodular maximization
Niv Buchbinder, Moran Feldman, Joseph Seffi, and Roy Schwartz · 2015
Later among the works it cites.
Monotone k-submodular function maximization with size constraints
Naoto Ohsaka and Yuichi Yoshida · 2015
Later among the works it cites.
Constrained submodular maximization via a non-symmetric technique
Niv Buchbinder and Moran Feldman · 2016
Closest in time.
Constrained submodular maximization: Beyond 1/e
Alina Ene and Huy L Nguyen · 2016
Closest in time.
Fast constrained submodular maximization: Personalized data summarization
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, and Amin Karbasi · 2016
Closest in time.
Distributed submodular maximization
Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar, and Andreas Krause · 2016
Closest in time.
The complexity of finite-valued csps
Johan Thapper and Stanislav Živnỳ · 2016
Closest in time.
Greed is still good: Maximizing monotone submodular+ supermodular functions
Wenruo Bai and Jeffrey A Bilmes · 2018
Closest in time.
Online submodular welfare maximization: Greedy beats 1/2 in random order
Nitish Korula, Vahab Mirrokni, and Morteza Zadimoghaddam · 2018
Closest in time.
Multi-Agent Submodular Optimization
Richard Santiago and F. Bruce Shepherd · 2018
Closest in time.
Submodular cost allocation problem and applications
Chandra Chekuri and Alina Ene · 2040
Closest in time.