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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We consider the problem of constructing networks that exhibit desirable algebraic rigidity properties, which can provide… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We design a class of submodular functions meant for document summarization tasks. These functions each combine two terms, one… (More)
  • figure 1
  • table 1
  • table 4
  • table 5
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider the problem of maximizing a nondecreasing submodular set function over various constraint structures. Specifically… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we obtain an (1 − e−1)-approximation algorithm for maximizing a nondecreasing submodular set function subject to a… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT… (More)
Is this relevant?