Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint
Submodular maximization under a knapsack constraint (SMK) is a fundamental combinatorial optimization problem with broad applications across machine learning and data mining. Motivated by large-scale applications where query efficiency is paramount, we study non-monotone SMK and focus on deterministic algorithms with l...