Efficient algorithms for robust submodular maximization under matroid constraints

07/25/2018
by   Sebastian Pokutta, et al.
0

In this work, we consider robust submodular maximization with matroid constraints. We give an efficient bi-criteria approximation algorithm that outputs a small family of feasible sets whose union has (nearly) optimal objective value. This algorithm theoretically performs less function calls than previous works at cost of adding more elements to the final solution. We also provide significant implementation improvements showing that our algorithm outperforms the algorithms in the existing literature. We finally assess the performance of our contributions in three real-world applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2019

A Unified Framework of Robust Submodular Optimization

In this paper, we shall study a unified framework of robust submodular o...
research
07/09/2020

Practical Budgeted Submodular Maximization

We consider the Budgeted Submodular Maximization problem, that seeks to ...
research
12/28/2022

Robust Sequence Networked Submodular Maximization

In this paper, we study the Robust optimization for sequence Networked s...
research
10/12/2022

Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets

In recent years, maximization of DR-submodular continuous functions beca...
research
01/31/2022

Deletion Robust Submodular Maximization over Matroids

Maximizing a monotone submodular function is a fundamental task in machi...
research
11/28/2021

Reconfiguration Problems on Submodular Functions

Reconfiguration problems require finding a step-by-step transformation b...
research
11/01/2020

Robust Sequence Submodular Maximization

Submodularity is an important property of set functions and has been ext...

Please sign up or login with your details

Forgot password? Click here to reset