Performance Bounds for the $k$-Batch Greedy Strategy in Optimization Problems with Curvature

Yajing Liu, Zhenliang Zhang, Edwin K. P. Chong +1

The $k$-batch greedy strategy is an approximate algorithm to solve optimization problems where the optimal solution is hard to obtain. Starting with the empty set, the $k$-batch gr…