Performance Bounds with Curvature for Batched Greedy Optimization
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Optimization Theory and Applications"
DOI: 10.1007/s10957-017-1177-1
Abstract: The batched greedy strategy is an approximation algorithm to maximize a set function subject to a matroid constraint. Starting with the empty set, the batched greedy strategy iteratively adds to the current solution set a… read more here.
Keywords: greedy strategy; batched greedy; batch size; strategy ... See more keywords