79 search results - page 2 / 16 » An Online Algorithm for Maximizing Submodular Functions |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
JMLR
2010
12 years 11 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...