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… 
2016
2016
Growing controllable networks via whiskering and submodular optimization
The topology of a network directly influences the behaviour and controllability of dynamical processes on that network. Therefore… 
2015
2015
Feature Selection for Classification under Anonymity Constraint
Over the last decade, proliferation of various online platforms and their increasing adoption by billions of users have… 
2012
2012
Submodular Inference of Diffusion Networks from Multiple Trees
Diffusion and propagation of information, influence and diseases take place over increasingly larger networks. We observe when a… 
2010
2010
A max-flow/min-cut algorithm for a class of wireless networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become… 
2010
2010
Generating secret in a network
This monograph studies the theory of information through the multiuser secret key agreement problem. A general notion of mutual… 
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
The Power of Two Prices: Beyond Cross-Monotonicity
Assuming strict consumer sovereignty (CS*), when can costsharing mechanisms simultaneously be group-strategyproof (GSP) and… 
Review
2000
Review
2000
Algorithms for submodular flows
The submodular flow problem, introduced by Edmonds and Giles [11], is one of the most important frameworks of efficiently… 
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… 
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)