Results 151 to 160 of about 887,365 (205)
Some of the next articles are maybe not open access.
Submodular Function Minimization under a Submodular Set Covering Constraint
Theory and Applications of Models of Computation, 2011In this paper, we consider the problem of minimizing a submodular function under a submodular set covering constraint. We propose an approximation algorithm for this problem by extending the algorithm of Iwata and Nagano [FOCS'09] for the set cover problem with a submodular cost function.
Naoyuki Kamiyama
openaire +2 more sources
Multi-level facility location as the maximization of a submodular set function
European Journal of Operational Research, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ortiz-Astorquiza, Camilo +2 more
openaire +2 more sources
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Sviridenko
openaire +2 more sources
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Conference on Integer Programming and Combinatorial Optimization, 2007Let $f:2^{N} \rightarrow \cal R^{+}$ be a non-decreasing submodular set function, and let $(N,\cal I)$ be a matroid. We consider the problem $\max_{S \in \cal I} f(S)$. It is known that the greedy algorithm yields a 1/2-approximation [9] for this problem. It is also known, via a reduction from the max-k-cover problem, that there is no (1 i¾?
Gruia Calinescu +3 more
openaire +2 more sources
Generalized Budgeted Submodular Set Function Maximization
International Symposium on Mathematical Foundations of Computer Science, 2018In 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 ...
Francesco Cellinese +3 more
semanticscholar +1 more source
Minimizing submodular functions over families of sets
Combinatorica, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goemans, M. X., Ramakrishnan, V. S.
openaire +2 more sources
Extractive Summarization using Cohesion Network Analysis and Submodular Set Functions
2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2020Numerous approaches have been introduced to automate the process of text summarization, but only few can be easily adapted to multiple languages. This paper introduces a multilingual text processing pipeline integrated in the open-source ReaderBench framework, which can be retrofit to cover more than 50 languages. While considering the extensibility of
Valentin Sergiu Cioaca +2 more
openaire +1 more source
Cooperative Set Function Optimization Without Communication or Coordination
Adaptive Agents and Multi-Agent Systems, 2017We introduce a new model for cooperative agents that seek to optimize a common goal without communication or coordination. Given a universe of elements V, a set of agents, and a set function f, we ask each agent i to select a subset Si ⊂ V such that the ...
Gustavo Malkomes +5 more
semanticscholar +1 more source
An exact cutting plane method for k-submodular function maximization
Discrete Optimization, 2020A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare.
Qimeng Yu, Simge Küçükyavuz
semanticscholar +1 more source
Augmenting a Submodular and Posi-modular Set Function by a Multigraph
Journal of Combinatorial Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nagamochi, Hiroshi +2 more
openaire +2 more sources