A Refined Analysis of Submodular Greedy

02/25/2021
by   Ariel Kulik, et al.
0

Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: (1) reduce the enumeration in the tight (1-e^-1)-approximation of [Sviridenko 04] from subsets of size three to two; (2) present an improved upper bound of 0.42945 for the classic algorithm which returns the better between a single element and the output of the greedy heuristic.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
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...
04/25/2020

A (1-e^-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem

We study the problem of maximizing a monotone submodular function subjec...
08/12/2020

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

Monotone submodular maximization with a knapsack constraint is NP-hard. ...
02/10/2020

On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness

Submodular maximization has been widely studied over the past decades, m...
11/15/2019

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings

We study the problem of maximizing a non-monotone submodular function un...
11/06/2014

Submodular meets Structured: Finding Diverse Subsets in Exponentially-Large Structured Item Sets

To cope with the high level of ambiguity faced in domains such as Comput...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.