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

05/31/2021
by   Zhongzheng Tang, et al.
0

We study the problem of maximizing a monotone k-submodular function f under a knapsack constraint, where a k-submodular function is a natural generalization of a submodular function to k dimensions. We present a deterministic (1/2-1/2e)-approximation algorithm that evaluates f O(n^5k^4) times.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/15/2018

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

We study the problem of maximizing a monotone submodular function subjec...
06/28/2020

Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints

The problem of maximizing nonnegative monotone submodular functions unde...
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...
12/18/2021

Streaming Based Bicriteria Approximation Algorithms for Submodular Optimization

This paper proposes the optimization problem Non-Monotone Submodular Cov...
01/12/2016

Submodular Optimization under Noise

We consider the problem of maximizing a monotone submodular function und...
12/31/2012

Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings

Submodular functions have many applications. Matchings have many applica...
02/25/2021

A Refined Analysis of Submodular Greedy

Many algorithms for maximizing a monotone submodular function subject to...
This week in AI

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