no code implementations • 18 Oct 2022 • Benjamin Biggs, James McMahon, Philip Baldoni, Daniel J. Stilwell
We provide theoretical bounds on the worst case performance of the greedy algorithm in seeking to maximize a normalized, monotone, but not necessarily submodular objective function under a simple partition matroid constraint.
