Efficient Subquadratic Submodular Maximization with a General Matroid Constraint

The authors present a randomized (1 - 1/e - ε)-approximation algorithm for monotone submodular maximization with a general matroid constraint that requires Õ(√rn) independence oracle and value oracle queries, improving upon the previous best algorithm.