Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid

07/15/2018
by   Niv Buchbinder, et al.
0

We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ϵ)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2021

On maximizing a monotone k-submodular function under a knapsack constraint

We study the problem of maximizing a monotone k-submodular function f un...
research
08/30/2022

Improved Deterministic Algorithms for Non-monotone Submodular Maximization

Submodular maximization is one of the central topics in combinatorial op...
research
07/13/2017

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

Submodular functions are a broad class of set functions, which naturally...
research
06/15/2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

We study the problem of maximizing a monotone submodular function subjec...
research
07/09/2020

Practical Budgeted Submodular Maximization

We consider the Budgeted Submodular Maximization problem, that seeks to ...
research
10/30/2018

Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm

The classical problem of maximizing a submodular function under a matroi...
research
08/09/2018

Few Cuts Meet Many Point Sets

We study the problem of how to breakup many point sets in R^d into small...

Please sign up or login with your details

Forgot password? Click here to reset