Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Active learning (machine learning)Alexander SchrijverArtificial intelligenceAutomatic summarization

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On the disintegration property of coherent upper conditional prevision defined by the Choquet integral with respect to its associated Hausdorff outer measure
Let $$ (\varOmega , d )$$(Ω,d) be a metric space where $$\varOmega $$Ω is a set with positive and finite Hausdorff outer measure… 
2014
2014
Exploiting cell dormancy and load balancing in LTE HetNets: Optimizing the proportional fairness utility
We consider the problem of maximizing the proportional fairness (PF) utility over heterogeneous wireless networks (HetNets) by… 
2012
2012
The Lazy Flipper: Efficient Depth-Limited Exhaustive Search in Discrete Graphical Models
We propose a new exhaustive search algorithm for optimization in discrete graphical models. When pursued to the full search depth… 
2008
2008
Which submodular functions are expressible using binary submodular functions
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been… 
2007
2007
Local Search for Balanced Submodular Clusterings
In this paper, we consider the problem of producing balanced clusterings with respect to a submodular objective function… 
Highly Cited
2003
Highly Cited
2003
A push-relabel framework for submodular function minimization and applications to parametric optimization
Highly Cited
2000
Highly Cited
2000
Minimizing a Convex Cost Closure Set
We study here a convex optimization problem with variables subject to a given partial order. This problem is a generalization of… 
1989
1989
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos Frank… 
Highly Cited
1988
Highly Cited
1988
Directed submodularity, ditroids and directed submodular flows
Set relations and operations such as inclusion, union and intersection are generalized to directed subsets whose elements are… 
1980
1980
Principal structures of submodular systems
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)