Search Results for author:
Found 2 papers, 0 papers with code
Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint
Our first algorithm, $\LAA$, returns an approximation ratio of $1/19$ within $O(nk)$ query complexity.
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint
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}$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
