Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,732,024 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Active learning (machine learning)
Alexander Schrijver
Artificial intelligence
Automatic summarization
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Exploiting cell dormancy and load balancing in LTE HetNets: Optimizing the proportional fairness utility
N. Prasad
,
Mustafa Y. Arslan
,
S. Rangarajan
IEEE International Conference on Communications…
2014
Corpus ID: 22924642
We consider the problem of maximizing the proportional fairness (PF) utility over heterogeneous wireless networks (HetNets) by…
Expand
2010
2010
Generating secret in a network
Chung Chan
2010
Corpus ID: 27142246
This monograph studies the theory of information through the multiuser secret key agreement problem. A general notion of mutual…
Expand
2010
2010
A max-flow/min-cut algorithm for a class of wireless networks
S. M. Sadegh
,
Tabatabaei Yazdi
,
S. Savari
ACM-SIAM Symposium on Discrete Algorithms
2010
Corpus ID: 15682801
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become…
Expand
2008
2008
Which submodular functions are expressible using binary submodular functions
Stanislav Živný
2008
Corpus ID: 15169590
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been…
Expand
2007
2007
Local Search for Balanced Submodular Clusterings
Mukund Narasimhan
,
J. Bilmes
International Joint Conference on Artificial…
2007
Corpus ID: 14753650
In this paper, we consider the problem of producing balanced clusterings with respect to a submodular objective function…
Expand
Highly Cited
2003
Highly Cited
2003
A push-relabel framework for submodular function minimization and applications to parametric optimization
L. Fleischer
,
S. Iwata
Discrete Applied Mathematics
2003
Corpus ID: 2050624
Highly Cited
2000
Highly Cited
2000
Minimizing a Convex Cost Closure Set
D. Hochbaum
,
M. Queyranne
SIAM Journal on Discrete Mathematics
2000
Corpus ID: 16510963
We study here a convex optimization problem with variables subject to a given partial order. This problem is a generalization of…
Expand
1989
1989
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
S. Fujishige
,
H. Röck
,
U. Zimmermann
Mathematics of Operations Research
1989
Corpus ID: 207233923
The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos Frank…
Expand
Highly Cited
1988
Highly Cited
1988
Directed submodularity, ditroids and directed submodular flows
L. Qi
Mathematical programming
1988
Corpus ID: 9823868
Set relations and operations such as inclusion, union and intersection are generalized to directed subsets whose elements are…
Expand
1980
1980
Principal structures of submodular systems
S. Fujishige
Discrete Applied Mathematics
1980
Corpus ID: 205053317
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)
ACCEPT & CONTINUE