Login / Signup
Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity.
Canh V. Pham
Published in:
CoRR (2024)
Keyphrases
</>
objective function
dynamic programming
learning algorithm
theoretical analysis
optimal solution
computational complexity
knapsack problem
machine learning
upper bound
classification algorithm
query complexity