no code implementations • 20 May 2024 • Canh V. Pham
In this work, we consider the Submodular Maximization under Knapsack (SMK) constraint problem over the ground set of size $n$.
no code implementations • 21 Sep 2023 • Dung T. K. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang
Our first algorithm, $\LAA$, returns an approximation ratio of $1/19$ within $O(nk)$ query complexity.
no code implementations • 17 May 2023 • Canh V. Pham, Tan D. Tran, Dung T. K. Ha, My T. Thai
This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of size $n$ subject to a knapsack constraint, $\mathsf{DLA}$ and $\mathsf{RLA}$.