Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,148,138 papers from all fields of science
Search
Sign In
Create Free Account
Submodular set function
Known as:
Submodular
, Submodular function
In mathematics, a submodular set function (also known as a submodular function) is a set function whose value, informally, has the property that the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Active learning (machine learning)
Alexander Schrijver
Artificial intelligence
Automatic summarization
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Submodular Function Maximization
Andreas Krause
,
D. Golovin
Tractability
2014
Corpus ID: 6107490
Submodularity is a property of set functions with deep theoretical consequences and far– reaching applications. At first glance…
Expand
Highly Cited
2008
Highly Cited
2008
Optimal approximation for the submodular welfare problem in the value oracle model
J. Vondrák
Symposium on the Theory of Computing
2008
Corpus ID: 170510
In the Submodular Welfare Problem, m items are to be distributed among n players with utility functions wi: 2[m] → R+. The…
Expand
Highly Cited
2007
Highly Cited
2007
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
G. Călinescu
,
C. Chekuri
,
Martin Pál
,
J. Vondrák
Conference on Integer Programming and…
2007
Corpus ID: 10051765
Let $f:2^{N} \rightarrow \cal R^{+}$ be a non-decreasing submodular set function, and let $(N,\cal I)$ be a matroid. We consider…
Expand
Highly Cited
2001
Highly Cited
2001
A combinatorial strongly polynomial algorithm for minimizing submodular functions
S. Iwata
,
L. Fleischer
,
S. Fujishige
JACM
2001
Corpus ID: 888513
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question…
Expand
Highly Cited
2000
Highly Cited
2000
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
A. Schrijver
Journal of combinatorial theory. Series B (Print)
2000
Corpus ID: 6285230
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm…
Expand
Highly Cited
1982
Highly Cited
1982
An analysis of the greedy algorithm for the submodular set covering problem
L. Wolsey
Comb.
1982
Corpus ID: 5702760
AbstractWe consider the problem: min $$\{ \mathop \Sigma \limits_{j \in s} f_j :z(S) = z(N),S \subseteqq N\} $$ wherez is a…
Expand
Highly Cited
1978
Highly Cited
1978
An analysis of approximations for maximizing submodular set functions—I
G. Nemhauser
,
L. Wolsey
,
M. Fisher
Mathematical programming
1978
Corpus ID: 206800425
LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)≥z(S⋃T)+z(S⋂T) for…
Expand
Highly Cited
1978
Highly Cited
1978
Minimizing a Submodular Function on a Lattice
D. M. Topkis
Operational Research
1978
Corpus ID: 207239920
This paper gives general conditions under which a collection of optimization problems, with the objective function and the…
Expand
Highly Cited
1978
Highly Cited
1978
Best Algorithms for Approximating the Maximum of a Submodular Set Function
G. Nemhauser
,
L. Wolsey
Mathematics of Operations Research
1978
Corpus ID: 9027438
A real-valued function z whose domain is all of the subsets of N = {1,..., n is said to be submodular if zS + zT ≥ zS ∪ T + zS…
Expand
Highly Cited
1978
Highly Cited
1978
Accelerated greedy algorithms for maximizing submodular set functions
M. Minoux
1978
Corpus ID: 119751462
Given a finite set E and a real valued function f on P(E) (the power set of E) the optimal subset problem (P) is to find S ⊂ E…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE