Mar 25, 2020 · In this paper, we consider the submodular multiple knapsack problem (SMKP). In SMKP, the profits of each subset of elements are specified by a ...
scholar.google.com › citations
Jul 19, 2023 · The goal is to find a feasible packing of elements over multiple bins (knapsacks) to maximize the profit. Recently,. Fairstein et al. [ESA20] ...
Jan 26, 2024 · Plenty of well-performed approximation algorithms have been designed for the problem over a variety of constraints. In this paper, we consider ...
In this paper, we consider the submodular multiple knapsack problem (SMKP). In SMKP, the profits of each subset of elements are specified by a monotone ...
We study the problem of maximizing a symmetric submodular objective subject to a knapsack/budget constraint. A submodular function is called symmetric when the ...
But their algorithm is random. In this paper, we make full use of the DR-submodularity over a bounded integer lattice, carry forward the greedy idea in the ...
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem ... A Tight Deterministic Algorithm for the Submodular Multiple Knapsack Problem.
We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (½ + ...
This leads to a deterministic version of our technique. Key words: submodular maximization; knapsack constraints; maximum coverage; generalized assignment ...
Oct 31, 2022 · Abstract: In this paper, we provide the first deterministic algorithm that achieves 1 / 2 -approximation for monotone submodular maximization ...