Before revision:  To complement our algorithmic contributions, we provide a hardness result which states that no algorithm making polynomially many queries to the value and independence oracles can achieve an approximation better than k + 1/2 + \varepsilon  .
After revision:  To complement our algorithmic contributions, we provide a hardness result which states that no algorithm making polynomially many queries to the value and independence oracles can achieve an approximation better than k + 1/2 + \varepsilon . We also present SubmodularGreedy.jl, a Julia package which implements these algorithms and may be downloaded at URL . Finally, we test the effectiveness of these algorithms on real datasets .