Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
Georgios AmanatidisFederico FuscoPhilip LazosStefano LeonardiAlberto Marchetti-SpaccamelaRebecca ReiffenhäuserPublished in: CoRR (2021)
Keyphrases
- data structure
- upper bound
- recently developed
- learning algorithm
- computational complexity
- computational cost
- worst case
- high computational complexity
- benchmark datasets
- computationally efficient
- lower complexity
- objective function
- data mining
- times faster
- combinatorial optimization
- optimization problems
- optimization methods
- significant improvement
- adaptive algorithms
- complexity measures
- constrained minimization