Results 1 to 10 of about 11,317 (132)
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i.
Deshpande, Amol +2 more
core +3 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 H Summers
exaly +2 more sources
On Equivalence of M$^\natural$-concavity of a Set Function and Submodularity of Its Conjugate
, 2017 A fundamental theorem in discrete convex analysis states that a set function is M$^\natural$-concave if and only if its conjugate function is submodular.
Murota, Kazuo, Shioura, Akiyoshi
core +2 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.
Francesco Cellinese +3 more
openaire +10 more sources
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 +4 more sources
New Query Lower Bounds for Submodular Function Minimization [PDF]
, 2019 We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\rightarrow \mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to $f(\cdot)$ as possible. State-of-the-
Graur, Andrei +3 more
core +2 more sources
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Ene, Alina, Vondrák, Jan
core +2 more sources
A Min-Max . . . Functions and Its Implications [PDF]
, 2014 A. Huber and V. Kolmogorov (ISCO 2012) introduced a concept of k-submodular function as a generalization of ordinary submodular (set) functions and bisubmodular functions and obtained a min-max theorem for minimization of k-submodular functions.
Satoru Fujishige, Shin-ichi Tanigawa
core +2 more sources
Ranking with Submodular Valuations [PDF]
, 2010 We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$.
Azar, Yossi, Gamzu, Iftah
core +3 more sources
New performance guarantees for the greedy maximization of submodular set functions [PDF]
Optimization Letters, 2016 We present new tight performance guarantees for the greedy maximization of nondecreasing submodular set functions. Our main result first provides a performance guarantee in terms of the overlap of the optimal and greedy solutions. As a consequence we improve performance guarantees of Nemhauser, Wolsey and Fisher (1978) and Conforti and Cornuéjols (1984)
Jussi Laitila, Atte Moilanen
openaire +3 more sources