Generalized budgeted submodular set function maximization [PDF]
Information and Computation, 2021 In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the overall cost is at most a given budget, and the profit is maximized.
Francesco Cellinese +3 more
openaire +13 more sources
Analyzing greedy vaccine allocation algorithms for metapopulation disease models. [PDF]
PLoS Computational BiologyAs observed in the case of COVID-19, effective vaccines for an emerging pandemic tend to be in limited supply initially and must be allocated strategically.
Jeffrey Keithley +3 more
doaj +2 more sources
Corrections to “Rigid Network Design Via Submodular Set Function Optimization” [PDF]
IEEE Transactions on Network Science and Engineering, 2020 We provide a correction to our paper "Rigid Network Design Via Submodular Set Function Optimization", which appeared in Volume 2, Issue 3 of the IEEE Transactions on Network Science and Engineering.
Iman Shames, Tyler Summers
exaly +2 more sources
Misinformation Correction Maximization Problem with Edge Addition in Social Networks [PDF]
Jisuanji kexue, 2022 The popularity of online social networks such as Wechat has aroused people’s more attention to information diffusion.The spread of misinformation in social networks may lead to serious consequences,such as economic losses and public panic.Therefore ...
SONG Xin-yue, SHUAI Tian-ping, CHEN Bin
doaj +1 more source
Quantitative approximation by nonlinear Angheluta-Choquet singular integrals
Journal of Numerical Analysis and Approximation Theory, 2020 By using the concept of nonlinear Choquet integral with respect to a capacity and as a generalization of the Poisson-Cauchy-Choquet operators, we introduce the nonlinear Angheluta-Choquet singular integrals with respect to a family of submodular set ...
Sorin Gal, Ionut Iancu
doaj +7 more sources
Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice
Mathematics, 2022 In recent years, the issue of maximizing submodular functions has attracted much interest from research communities. However, most submodular functions are specified in a set function.
Bich-Ngan T. Nguyen +3 more
doaj +1 more source
Some Results about the Contractions and the Pendant Pairs of a Submodular System [PDF]
Sahand Communications in Mathematical Analysis, 2019 Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory ...
Saeid Hanifehnezhad, Ardeshir Dolati
doaj +1 more source
Approximating Special Social Influence Maximization Problems
Tsinghua Science and Technology, 2020 Social Influence Maximization Problems (SIMPs) deal with selecting k seeds in a given Online Social Network (OSN) to maximize the number of eventually-influenced users.
Jie Wu, Ning Wang
doaj +1 more source
Bicriteria Algorithms for Approximately Submodular Cover Under Streaming Model
Tsinghua Science and Technology, 2023 In this paper, we mainly investigate the optimization model that minimizes the cost function such that the cover function exceeds a required threshold in the set cover problem, where the cost function is additive linear, and the cover function is non ...
Yijing Wang +3 more
doaj +1 more source
Distributed strategy selection: A submodular set function maximization approach
Automatica, 2023 Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain. Submodular set function optimization problems, however, are known to be NP-hard.
Navid Rezazadeh, Solmaz S. Kia
openaire +5 more sources