Submodular set function - Open Access .click

Mathematics of Operations Research, 1978
A real-valued function z whose domain is all of the subsets of N = {1, …, n) is said to be submodular if z(S) + z(T) ≥ z(S ∪ T) + z(S ∩ T), ∀S, T ⊆ N, and nondecreasing if z(S) ≤ z(T), ∀S ⊂ T ⊆ N. We consider the problem maxS⊂N {z(S): |S| ≤ K, z submodular and nondecreasing, z(Ø) = 0}.
G L Nemhauser
exaly +3 more sources

A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maxim Sviridenko
exaly +2 more sources

Convex Analysis for Minimizing and Learning Submodular Set Functions [PDF]

, 2013
The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a sum of concave functions composed with modular functions.
Peter Stobbe, Stobbe, Peter
openaire +2 more sources

Minimizing submodular functions over families of sets

Combinatorica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel X. Goemans, V. S. Ramakrishnan
openaire +3 more sources

fos: computer and information sciences
submodular function
combinatorial optimization

approximation algorithm
data structures and algorithms cs.ds
computer science - data structures and algorithms

fos: mathematics
16. peace & justice
nonlinear choquet integral