Sep 2026
A Learning-Augmented Framework for Knapsack-Constrained Submodular Maximization Problems
This work proposes a framework for the general knapsack-constrained submodular maximization problems that incorporates advice from learning models or domain experts and is ρ-robust and 1-consistent, where ρ is the provable worst-case guarantee.
Yan-Hui Zhu
· ACM SIGMETRICS Performance E... · 0 citations