For example, in (Fisher et al., 1978), a simple greedy algorithm for monotone submodular function maximization with a matroid constraint is shown to have a constant approximation factor.
the greedy algorithm finds a solution A such that f (A) ≥ 1 m+1 f (A * ) where A * is the optimal solution and m is number of matroid constraints.