1 paper
Benjamin Biggs, James McMahon, Philip Baldoni +1
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…