Results 11 to 20 of about 11,336 (151)

Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions [PDF]

open access: yes, 2015
The Adaptive Seeding problem is an algorithmic challenge motivated by influence maximization in social networks: One seeks to select among certain accessible nodes in a network, and then select, adaptively, among neighbors of those nodes as they become ...
Badanidiyuru, Ashwinkumar   +4 more
core   +1 more source

Parallelizing greedy for submodular set function maximization in matroids and beyond [PDF]

open access: yesProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
We consider parallel, or low adaptivity, algorithms for submodular function maximization. This line of work was recently initiated by Balkanski and Singer and has already led to several interesting results on the cardinality constraint and explicit packing constraints.
Chandra Chekuri, Kent Quanrud
openaire   +2 more sources

Maximizing submodular set function with connectivity constraint: Theory and application to networks [PDF]

open access: yes2013 Proceedings IEEE INFOCOM, 2013
In this paper, we investigate the wireless network deployment problem, which seeks the best deployment of a given limited number of wireless routers. We found that many goals for network deployment, such as maximizing the number of covered users or areas, or the total throughput of the network, can be modelled with the submodular set function ...
Tung-Wei Kuo   +2 more
openaire   +2 more sources

Submodular Optimization with Contention Resolution Extensions [PDF]

open access: yes, 2019
This paper considers optimizing a submodular function subject to a set of downward closed constraints. Previous literature on this problem has often constructed solutions by (1) discovering a fractional solution to the multi-linear extension and (2 ...
Moseley, Benjamin, Sviridenko, Maxim
core   +1 more source

Symmetric Submodular Function Minimization Under Hereditary Family Constraints

open access: yes, 2010
We present an efficient algorithm to find non-empty minimizers of a symmetric submodular function over any family of sets closed under inclusion. This for example includes families defined by a cardinality constraint, a knapsack constraint, a matroid ...
Goemans, Michel X., Soto, José A.
core   +2 more sources

A simple combinatorial algorithm for submodular function minimization [PDF]

open access: yes, 2009
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(n6EO log nM) [O (n superscript 6 E O log nM)] time, where n is the cardinality of the ground set, M is the ...
Iwata, Satoru, Orlin, James B.
core   +1 more source

Shaping Level Sets with Submodular Functions

open access: yesCoRR, 2010
We consider a class of sparsity-inducing regularization terms based on submodular functions. While previous work has focused on non-decreasing functions, we explore symmetric submodular functions and their \lova extensions. We show that the Lovasz extension may be seen as the convex envelope of a function that depends on level sets (i.e., the set of ...
openaire   +4 more sources

Submodularity of a Set Label Disagreement Function

open access: yesCoRR, 2013
A set label disagreement function is defined over the number of variables that deviates from the dominant label. The dominant label is the value assumed by the largest number of variables within a set of binary variables. The submodularity of a certain family of set label disagreement function is discussed in this manuscript. Such disagreement function
openaire   +2 more sources

Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization

open access: yes, 2015
We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ...
Krause, Andreas   +2 more
core   +1 more source

Mechanism Design via Correlation Gap [PDF]

open access: yes, 2010
For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple in form, can perform surprisingly well compared to the optimal mechanisms ...
Yan, Qiqi
core   +2 more sources

Home - About - Disclaimer - Privacy