Results 121 to 130 of about 5,397,625 (216)

A Note on Schrijver’s Submodular Function Minimization Algorithm

open access: yes, 2003
We prove that Schrijver’s submodular function minimization algorithm is faster by a factor of n than was proved by Schrijver in his ...
Jens Vygen
core  

Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions

open access: yes, 2020
We investigate three related and important problems connected to machine learning: approximating a submodular function everywhere, learning a submodular function (in a PAC-like ...

core  

Submodular functions and optimization

open access: yes, 2005
It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing ...
Fujishige, Satoru
core  

Maximizing bisubmodular and k-submodular functions

open access: yes, 2013
Submodular functions play a key role in combinatorial optimization and in the study of valued constraint satisfaction problems. Recently, there has been interest in the class of bisubmodular functions, which assign values to disjoint pairs of sets.
Justin Ward   +3 more
core   +1 more source

Local Search for Balanced Submodular Clusterings

open access: yes, 2008
In this paper, we consider the problem of producing balanced clusterings with respect to a submodular objective function. Submodular objective functions occur frequently in many applications, and hence this problem is broadly applicable. We show that the
M. Narasimhan
core  

Online Dynamic Submodular Optimization [PDF]

open access: yes
We propose new algorithms with provable performance for online binary optimization subject to general constraints and in dynamic settings. We consider the subset of problems in which the objective function is submodular.
Lesage-Landry, Antoine, Pallage, Julien
core   +1 more source

Hypergraphic submodular function minimization

open access: yesDiscrete Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A unified continuous greedy algorithm for $k$-submodular maximization under a down-monotone constraint

open access: yes, 2023
A $k$-submodular function is a generalization of the submodular set function. Many practical applications can be modeled as maximizing a $k$-submodular function, such as multi-cooperative games, sensor placement with $k$ type sensors, influence ...
Zhang, Hongyang, Luo, Wenchang
core  

Algorithms for Optimizing the Ratio of Submodular Functions

open access: yes, 2016
We investigate a new optimization problem involving minimizing the Ratio of two Submodular (RS) functions. We argue that this problem occurs naturally in several real world applications.
Rishabh Iyer   +3 more
core  

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

open access: yes, 2021
International audienceWe consider the problem of maximizing a non-negative submodular function under the b-matching constraint, in the semi-streaming model. When the function is linear, monotone, and non-monotone, we obtain the approximation ratios of 2 +
Sellier, François, Huang, Chien-Chung
core  

Home - About - Disclaimer - Privacy