Results 121 to 130 of about 476 (159)

Minimizing submodular functions over families of sets

Combinatorica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel X. Goemans, V. S. Ramakrishnan
openaire   +2 more sources

An analysis of approximations for maximizing submodular set functions—I

Mathematical Programming, 1978
LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)źz(SźT)+z(SźT) for allS, T inN. Such a function is called submodular. We consider the problem maxSźN{a(S):|S|≤K,z(S) submodular}. Several hard combinatorial optimization problems can be posed in this framework.
George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher   +2 more
openaire   +1 more source

Augmenting a Submodular and Posi-modular Set Function by a Multigraph

Journal of Combinatorial Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki   +2 more
openaire   +2 more sources

Cones of alternating and cut submodular set functions

Combinatorica, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Multi-level facility location as the maximization of a submodular set function

European Journal of Operational Research, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte   +2 more
openaire   +1 more source

Rigid Network Design Via Submodular Set Function Optimization

IEEE Transactions on Network Science and Engineering, 2015
We consider the problem of constructing networks that exhibit desirable algebraic rigidity properties, which can provide significant performance improvements for associated formation shape control and localization tasks. We show that the network design problem can be formulated as a submodular set function optimization problem and propose greedy ...
Iman Shames, Tyler H. Summers
openaire   +1 more source

Rough set methods in feature selection via submodular function

Soft Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaozhong Zhu, William Zhu 0001, Xin-Nan Fan   +2 more
openaire   +2 more sources

Submodular Function Minimization under a Submodular Set Covering Constraint

2011
In 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.
openaire   +1 more source

Extractive Summarization using Cohesion Network Analysis and Submodular Set Functions

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2020
Numerous 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, Mihai Dascalu, Danielle S. McNamara   +2 more
openaire   +1 more source

Extreme points of a set of contents majorized by a submodular set function

Archiv der Mathematik, 1992
The extreme points of the set of contents (finitely additive measures) on an algebra \(\mathcal A\), which are majorized by a submodular set function \(u\), have already been characterized for certain special cases [see \textit{J. Rosenmüller}, Arch. Math. 22, 420-430 (1971; Zbl 0237.28002), \textit{F. Dalbaen}, J. Math. Anal. Appl.
openaire   +2 more sources