Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
Georgios AmanatidisFederico FuscoPhilip LazosStefano LeonardiAlberto Marchetti-SpaccamelaRebecca ReiffenhäuserPublished in: ICML (2021)
Keyphrases
- computational complexity
- computational cost
- space complexity
- worst case
- upper bound
- adaptive algorithms
- objective function
- data structure
- learning algorithm
- high computational complexity
- dynamic programming
- data mining
- high order
- times faster
- memory requirements
- optimization methods
- significant improvement
- lower complexity
- constrained minimization