- In mathematics, a
submodular set
function (also
known as a
submodular function) is a set
function that, informally,
describes the
relationship between...
- give constant-factor
approximations to
optimization problems with the
submodular structure.
Greedy algorithms produce good
solutions on some mathematical...
- In the
theory of
combinatorial optimization,
submodular flow is a
general class of
optimization problems that
includes as
special cases the minimum-cost...
-
submodular optimization. For example, the set
cover problem is a
special case of
submodular optimization,
since the set
cover function is
submodular....
- non-negative,
every submodular function is subadditive. However,
there are non-negative
subadditive functions that are not
submodular. For example, ****ume...
- {\displaystyle x} and y {\displaystyle y} . If −f is
supermodular then f is
called submodular, and if the
inequality is
changed to an
equality the
function is modular...
-
submodular agent has a
utility function that is a
submodular set function. This
means that the agent's
utility has
decreasing marginals.
Submodular utilities...
-
Theory of
Greedy Algorithms Archived 2016-03-04 at the
Wayback Machine Submodular Functions and
Optimization Matchings,
Matroids and
Submodular Functions...
- the
maximum cut
problem as
maximizing a pseudo-Boolean function. The
submodular set
functions can be
viewed as a
special class of pseudo-Boolean functions...
- f} is
submodular then QPBO
produces a
global optimum equivalently to
graph cut optimization,
while if f {\displaystyle f}
contains non-
submodular terms...
