Results 51 to 60 of about 11,336 (151)

A Mazur-Orlicz type theorem for submodular set functions

Journal of Mathematical Analysis and Applications, 1986
Let \({\mathcal L}\) be a lattice of subsets of a given set \(\Omega\) with \(\emptyset \in {\mathcal L}\). A function \(\gamma:{\mathcal L}\to {\mathbb{R}}\cup \{- \infty \}\) is called a submodular (modular) set function if \(\gamma (\emptyset)=0\) and \[ \gamma (A\cup B)+\gamma (A\cap B)\leq (=)\gamma (A)+\gamma (B),\quad A\in {\mathcal L},\quad B ...
openaire   +2 more sources

Balanced sets in an independence structure induced by a submodular function

Journal of Mathematical Analysis and Applications, 1983
AbstractA submodular (and non-decreasing) function on a set induces an independence structure; the notion of a “balanced” set in this situation helps us determine whether a given independence structure is induced by any submodular function other than its own rank function, answering a question of U. S. R. Murty and I. Simon.
openaire   +1 more source

Uniform and pointwise convergence of Bernstein–Durrmeyer operators with respect to monotone and submodular set functions

Journal of Mathematical Analysis and Applications, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gal, Sorin G., Opris, Bogdan D.
openaire   +2 more sources

A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions

, 2000
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver.
Fleischer, Lisa, Fujishige, Satoru, Iwata, Satoru   +2 more
core   +1 more source

Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering. [PDF]

Front Big Data, 2023
Zhu Y, Segarra S.
europepmc   +1 more source

On the Initial Set of Constraints for Graph-Based Submodular Function Maximization

Acta Cybernetica
A crucial problem in combinatorial optimization is the submodular function maximization (SFM), and in many cases it involves graphs on which the maximization is specified. The problem is well-studied and hence there are several proposed algorithms in the literature.
Eszter Csókás, Tamás Vinkó
openaire   +1 more source

Ranking with submodular functions on a budget. [PDF]

Data Min Knowl Discov, 2022
Zhang G, Tatti N, Gionis A.
europepmc   +1 more source

Regularized impurity reduction: accurate decision trees with complexity guarantees. [PDF]

Data Min Knowl Discov, 2023
Zhang G, Gionis A.
europepmc   +1 more source

Maximizing Submodular Set Functions Subject to Multiple Linear Constraints [PDF]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Ariel Kulik, Hadas Shachnai, Tami Tamir
openaire   +1 more source

Discovering Key Sub-Trajectories to Explain Traffic Prediction. [PDF]

Sensors (Basel), 2022
Wang H, Fan Z, Chen J, Zhang L, Song X.
europepmc   +1 more source