Results 11 to 20 of about 887,365 (205)
Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack [PDF]
ACM Transactions on Algorithms, 2016 We present a new approximation algorithm for the stochastic submodular set cover (SSSC) problem called adaptive dual greedy . We use this algorithm to obtain a 3-approximation algorithm solving the stochastic Boolean function evaluation (SBFE) problem for linear threshold formulas (LTFs).
Amol Deshpande +2 more
openaire +2 more sources
Journal of Mathematical Analysis and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gal, Sorin G., Opris, Bogdan D.
openaire +3 more sources
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.
Cellinese F. +3 more
openaire +10 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
Improved Lower Bounds for Submodular Function Minimization [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorithm on a ground set of n elements ...
Deeparnab Chakrabarty +3 more
semanticscholar +1 more source
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
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
Computation, 2022 In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
doaj +1 more source
International Journal of Distributed Sensor Networks, 2021 In this article, we consider the problem of optimally selecting a subset of transmitters from a transmitter set available to a multiple-input and multiple-output radar network.
Chenggang Wang +3 more
doaj +1 more source