An almost optimal approximation algorithm for monotone submodular multiple knapsack

We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set I of items, each has a non-negative weight, and a set of bins of arbitrary capacities. Also, we are given a submodular, monotone and non-negative function f over subsets of...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 125; pp. 149 - 165
Main Authors:	Fairstein, Yaron, Kulik, Ariel, Naor, Joseph (Seffi), Raz, Danny, Shachnai, Hadas
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2022
Subjects:	Approximation algorithms Monotone submodular functions Multiple Knapsack constraint Approximation algorithms Monotone submodular functions Multiple Knapsack constraint
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!