Results 191 to 200 of about 5,146,266 (215)

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

SIAM Journal on Discrete Mathematics, 2022
Yuichi Yoshida, Naonori Kakimura, Simon Mauras   +2 more
exaly  

Improved Randomized Algorithm for k-Submodular Function Maximization

SIAM Journal on Discrete Mathematics, 2021
exaly  

Maximizing a non-decreasing non-submodular function subject to various types of constraints

Journal of Global Optimization, 2022
Wenguo Yang
exaly  

MATROIDS AND SUBMODULAR FUNCTIONS

The Quarterly Journal of Mathematics, 1976
openaire   +2 more sources

A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters, 2004
Maxim Sviridenko
exaly  

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

SIAM Journal on Computing, 2011
Gruia Calinescu, Chandra Chekuri, Martin Pal   +2 more
exaly  

On maximizing a monotone k-submodular function subject to a matroid constraint

Discrete Optimization, 2017
Shinsaku Sakaue
exaly  

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

SIAM Journal on Computing, 2014
Rico Zenklusen, Chandra Chekuri
exaly  

Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint

SIAM Journal on Discrete Mathematics, 2019
Yuichi Yoshida
exaly  

Matchings, matroids and submodular functions.

2008
This thesis focuses on three fundamental problems in combinatorial optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems.
openaire   +1 more source