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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this chapter we study fundamental results on maximizing a special class of functions called submodular functions under various… 
Highly Cited
2016
Highly Cited
2016
Can we summarize multi-category data based on user preferences in a scalable manner? Many utility functions used for data… 
Highly Cited
2015
Highly Cited
2015
An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces… 
Highly Cited
2015
Highly Cited
2015
We present a novel method for summarizing raw, casually captured videos. The objective is to create a short summary that still… 
Highly Cited
2012
Highly Cited
2012
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a dierence between submodular… 
Highly Cited
2011
Highly Cited
2011
Given a finite ground set N and a value vector $${a \in \mathbb{R}^N}$$, we consider optimization problems involving maximization… 
Highly Cited
2010
Highly Cited
2010
Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents… 
Highly Cited
2010
Highly Cited
2010
We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2 (m) ! R+. The… 
Highly Cited
2009
Highly Cited
2009
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems… 
Highly Cited
1998
Highly Cited
1998
We describe a purely combinatorial algorithm which, given a submodular set functionf on a finite setV, finds a nontrivial subsetA…