7 citations · 9 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 1 cited
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
A multiple knapsack constraint over a set of items is defined by a set of bins of arbitrary capacities, and a weight for each of the items. An assignment for the constraint is an a…
cs.DS2020
An Almost Optimal Approximation Algorithm for Monotone Submodular Multiple Knapsack
Yaron Fairstein, Ariel Kulik, Joseph +3
We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set of items, each has a non-negative weight, and a…