Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity
External IDs:dblp:journals/tcs/AmanatidisFLLMR26
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview